./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:13:17,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:13:17,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:13:17,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:13:17,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:13:17,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:13:17,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:13:17,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:13:17,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:13:17,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:13:17,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:13:17,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:13:17,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:13:17,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:13:17,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:13:17,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:13:17,883 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:13:17,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:13:17,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:13:17,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:13:17,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:13:17,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:13:17,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:13:17,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:13:17,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:13:17,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:13:17,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:13:17,894 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:13:17,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:13:17,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:13:17,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:13:17,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:13:17,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:13:17,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:13:17,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:13:17,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:13:17,898 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:13:17,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:13:17,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:13:17,912 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:13:17,912 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:13:17,912 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:13:17,912 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:13:17,913 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:13:17,913 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:13:17,913 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:13:17,913 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:13:17,913 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:13:17,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:13:17,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:13:17,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:13:17,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:13:17,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:13:17,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:13:17,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:13:17,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:13:17,916 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:13:17,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:13:17,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:13:17,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:13:17,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:13:17,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:13:17,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:13:17,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:13:17,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:13:17,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:13:17,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:13:17,918 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:13:17,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:13:17,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:13:17,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:13:17,918 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_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-11-10 05:13:17,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:13:17,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:13:17,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:13:17,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:13:17,970 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:13:17,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 05:13:18,021 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/data/70a585375/7715ec0ea9c74448a6483b6c8918c2d3/FLAG97fe8b87f [2018-11-10 05:13:18,410 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:13:18,411 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 05:13:18,421 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/data/70a585375/7715ec0ea9c74448a6483b6c8918c2d3/FLAG97fe8b87f [2018-11-10 05:13:18,433 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/data/70a585375/7715ec0ea9c74448a6483b6c8918c2d3 [2018-11-10 05:13:18,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:13:18,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:13:18,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:13:18,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:13:18,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:13:18,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24840ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18, skipping insertion in model container [2018-11-10 05:13:18,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:13:18,483 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:13:18,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:13:18,669 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:13:18,718 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:13:18,731 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:13:18,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18 WrapperNode [2018-11-10 05:13:18,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:13:18,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:13:18,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:13:18,732 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:13:18,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:13:18,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:13:18,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:13:18,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:13:18,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... [2018-11-10 05:13:18,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:13:18,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:13:18,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:13:18,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:13:18,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/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 05:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:13:18,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:13:18,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 05:13:18,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 05:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:13:18,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:13:18,990 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:13:18,990 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:13:19,425 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:13:19,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:19 BoogieIcfgContainer [2018-11-10 05:13:19,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:13:19,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:13:19,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:13:19,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:13:19,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:13:18" (1/3) ... [2018-11-10 05:13:19,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4181a0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:13:19, skipping insertion in model container [2018-11-10 05:13:19,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:18" (2/3) ... [2018-11-10 05:13:19,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4181a0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:13:19, skipping insertion in model container [2018-11-10 05:13:19,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:19" (3/3) ... [2018-11-10 05:13:19,432 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 05:13:19,438 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:13:19,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:13:19,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:13:19,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:13:19,482 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:13:19,482 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:13:19,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:13:19,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:13:19,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:13:19,482 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:13:19,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:13:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-10 05:13:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 05:13:19,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:19,505 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 05:13:19,506 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-11-10 05:13:19,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:19,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:19,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:19,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:19,710 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 05:13:19,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:19,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:19,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:19,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:19,732 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-10 05:13:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:19,803 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-10 05:13:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 05:13:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:19,814 INFO L225 Difference]: With dead ends: 380 [2018-11-10 05:13:19,814 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 05:13:19,817 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 05:13:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 05:13:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-10 05:13:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 05:13:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-10 05:13:19,860 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-10 05:13:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:19,860 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-10 05:13:19,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-10 05:13:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 05:13:19,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:19,863 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 05:13:19,863 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:19,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash -770617106, now seen corresponding path program 1 times [2018-11-10 05:13:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:19,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:19,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:19,922 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 05:13:19,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:19,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:19,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:19,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:19,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:19,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:19,924 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-10 05:13:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:20,083 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-11-10 05:13:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:20,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 05:13:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:20,085 INFO L225 Difference]: With dead ends: 476 [2018-11-10 05:13:20,085 INFO L226 Difference]: Without dead ends: 266 [2018-11-10 05:13:20,086 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 05:13:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-10 05:13:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-11-10 05:13:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 05:13:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-10 05:13:20,105 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-10 05:13:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:20,105 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-10 05:13:20,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-10 05:13:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 05:13:20,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:20,107 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 05:13:20,107 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:20,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 304754323, now seen corresponding path program 1 times [2018-11-10 05:13:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:13:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:20,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:20,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:20,181 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-10 05:13:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:20,217 INFO L93 Difference]: Finished difference Result 404 states and 585 transitions. [2018-11-10 05:13:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:20,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 05:13:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:20,219 INFO L225 Difference]: With dead ends: 404 [2018-11-10 05:13:20,220 INFO L226 Difference]: Without dead ends: 280 [2018-11-10 05:13:20,221 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 05:13:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-10 05:13:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-11-10 05:13:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-10 05:13:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2018-11-10 05:13:20,236 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 63 [2018-11-10 05:13:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:20,236 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2018-11-10 05:13:20,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2018-11-10 05:13:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 05:13:20,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:20,239 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 05:13:20,240 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:20,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 242714709, now seen corresponding path program 1 times [2018-11-10 05:13:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:20,311 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 05:13:20,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:20,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:20,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:20,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:20,313 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 3 states. [2018-11-10 05:13:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:20,458 INFO L93 Difference]: Finished difference Result 652 states and 968 transitions. [2018-11-10 05:13:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:20,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 05:13:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:20,461 INFO L225 Difference]: With dead ends: 652 [2018-11-10 05:13:20,461 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 05:13:20,462 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 05:13:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 05:13:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2018-11-10 05:13:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-10 05:13:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 504 transitions. [2018-11-10 05:13:20,476 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 504 transitions. Word has length 63 [2018-11-10 05:13:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:20,477 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 504 transitions. [2018-11-10 05:13:20,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-11-10 05:13:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 05:13:20,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:20,479 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 05:13:20,480 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:20,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 108701203, now seen corresponding path program 1 times [2018-11-10 05:13:20,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:20,536 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 05:13:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:20,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:20,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:20,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:20,537 INFO L87 Difference]: Start difference. First operand 364 states and 504 transitions. Second operand 3 states. [2018-11-10 05:13:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:20,660 INFO L93 Difference]: Finished difference Result 768 states and 1078 transitions. [2018-11-10 05:13:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:20,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 05:13:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:20,665 INFO L225 Difference]: With dead ends: 768 [2018-11-10 05:13:20,665 INFO L226 Difference]: Without dead ends: 416 [2018-11-10 05:13:20,666 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 05:13:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-11-10 05:13:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 404. [2018-11-10 05:13:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-11-10 05:13:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 554 transitions. [2018-11-10 05:13:20,676 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 554 transitions. Word has length 63 [2018-11-10 05:13:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:20,677 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 554 transitions. [2018-11-10 05:13:20,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 554 transitions. [2018-11-10 05:13:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 05:13:20,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:20,679 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 05:13:20,679 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:20,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash 991869018, now seen corresponding path program 1 times [2018-11-10 05:13:20,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:20,716 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 05:13:20,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:20,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:20,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:20,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:20,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:20,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:20,718 INFO L87 Difference]: Start difference. First operand 404 states and 554 transitions. Second operand 3 states. [2018-11-10 05:13:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:20,921 INFO L93 Difference]: Finished difference Result 904 states and 1278 transitions. [2018-11-10 05:13:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:20,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 05:13:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:20,924 INFO L225 Difference]: With dead ends: 904 [2018-11-10 05:13:20,924 INFO L226 Difference]: Without dead ends: 510 [2018-11-10 05:13:20,925 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 05:13:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-10 05:13:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 484. [2018-11-10 05:13:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-10 05:13:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 690 transitions. [2018-11-10 05:13:20,937 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 690 transitions. Word has length 77 [2018-11-10 05:13:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:20,937 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 690 transitions. [2018-11-10 05:13:20,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 690 transitions. [2018-11-10 05:13:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:13:20,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:20,939 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 05:13:20,939 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:20,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1032276431, now seen corresponding path program 1 times [2018-11-10 05:13:20,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:20,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:20,992 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 05:13:20,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:20,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:20,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:20,994 INFO L87 Difference]: Start difference. First operand 484 states and 690 transitions. Second operand 3 states. [2018-11-10 05:13:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:21,126 INFO L93 Difference]: Finished difference Result 1006 states and 1443 transitions. [2018-11-10 05:13:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:21,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 05:13:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:21,129 INFO L225 Difference]: With dead ends: 1006 [2018-11-10 05:13:21,129 INFO L226 Difference]: Without dead ends: 534 [2018-11-10 05:13:21,131 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 05:13:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-10 05:13:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 528. [2018-11-10 05:13:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-10 05:13:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 744 transitions. [2018-11-10 05:13:21,148 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 744 transitions. Word has length 81 [2018-11-10 05:13:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:21,149 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 744 transitions. [2018-11-10 05:13:21,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 744 transitions. [2018-11-10 05:13:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 05:13:21,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:21,151 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:21,152 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:21,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1497570332, now seen corresponding path program 1 times [2018-11-10 05:13:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 05:13:21,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:21,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:21,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:21,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:21,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:21,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:21,240 INFO L87 Difference]: Start difference. First operand 528 states and 744 transitions. Second operand 3 states. [2018-11-10 05:13:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:21,424 INFO L93 Difference]: Finished difference Result 1150 states and 1646 transitions. [2018-11-10 05:13:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:21,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 05:13:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:21,427 INFO L225 Difference]: With dead ends: 1150 [2018-11-10 05:13:21,427 INFO L226 Difference]: Without dead ends: 630 [2018-11-10 05:13:21,429 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 05:13:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-11-10 05:13:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 610. [2018-11-10 05:13:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 05:13:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 844 transitions. [2018-11-10 05:13:21,445 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 844 transitions. Word has length 102 [2018-11-10 05:13:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:21,445 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 844 transitions. [2018-11-10 05:13:21,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 844 transitions. [2018-11-10 05:13:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 05:13:21,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:21,447 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:21,448 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:21,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1631583838, now seen corresponding path program 1 times [2018-11-10 05:13:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:13:21,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:21,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:21,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:21,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:21,491 INFO L87 Difference]: Start difference. First operand 610 states and 844 transitions. Second operand 3 states. [2018-11-10 05:13:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:21,544 INFO L93 Difference]: Finished difference Result 1678 states and 2350 transitions. [2018-11-10 05:13:21,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:21,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 05:13:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:21,548 INFO L225 Difference]: With dead ends: 1678 [2018-11-10 05:13:21,549 INFO L226 Difference]: Without dead ends: 1080 [2018-11-10 05:13:21,550 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 05:13:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-11-10 05:13:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2018-11-10 05:13:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2018-11-10 05:13:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1515 transitions. [2018-11-10 05:13:21,580 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1515 transitions. Word has length 102 [2018-11-10 05:13:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:21,580 INFO L481 AbstractCegarLoop]: Abstraction has 1078 states and 1515 transitions. [2018-11-10 05:13:21,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1515 transitions. [2018-11-10 05:13:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 05:13:21,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:21,583 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 05:13:21,583 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:21,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1799986566, now seen corresponding path program 1 times [2018-11-10 05:13:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:21,629 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 05:13:21,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:21,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:21,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:21,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:21,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:21,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:21,631 INFO L87 Difference]: Start difference. First operand 1078 states and 1515 transitions. Second operand 3 states. [2018-11-10 05:13:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:21,683 INFO L93 Difference]: Finished difference Result 2144 states and 3024 transitions. [2018-11-10 05:13:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:21,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 05:13:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:21,689 INFO L225 Difference]: With dead ends: 2144 [2018-11-10 05:13:21,690 INFO L226 Difference]: Without dead ends: 1588 [2018-11-10 05:13:21,691 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 05:13:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2018-11-10 05:13:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2018-11-10 05:13:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-11-10 05:13:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2235 transitions. [2018-11-10 05:13:21,733 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2235 transitions. Word has length 102 [2018-11-10 05:13:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:21,733 INFO L481 AbstractCegarLoop]: Abstraction has 1588 states and 2235 transitions. [2018-11-10 05:13:21,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2235 transitions. [2018-11-10 05:13:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 05:13:21,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:21,736 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 05:13:21,736 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:21,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1084705271, now seen corresponding path program 1 times [2018-11-10 05:13:21,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:21,774 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 05:13:21,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:21,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:21,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:21,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:21,776 INFO L87 Difference]: Start difference. First operand 1588 states and 2235 transitions. Second operand 3 states. [2018-11-10 05:13:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:21,828 INFO L93 Difference]: Finished difference Result 2100 states and 2962 transitions. [2018-11-10 05:13:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:21,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-10 05:13:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:21,835 INFO L225 Difference]: With dead ends: 2100 [2018-11-10 05:13:21,836 INFO L226 Difference]: Without dead ends: 2098 [2018-11-10 05:13:21,837 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 05:13:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-11-10 05:13:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2018-11-10 05:13:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-11-10 05:13:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2959 transitions. [2018-11-10 05:13:21,891 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2959 transitions. Word has length 104 [2018-11-10 05:13:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:21,891 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2959 transitions. [2018-11-10 05:13:21,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2959 transitions. [2018-11-10 05:13:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 05:13:21,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:21,896 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:21,896 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:21,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1225308302, now seen corresponding path program 1 times [2018-11-10 05:13:21,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:21,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 05:13:21,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:21,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:21,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:21,943 INFO L87 Difference]: Start difference. First operand 2098 states and 2959 transitions. Second operand 3 states. [2018-11-10 05:13:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:22,117 INFO L93 Difference]: Finished difference Result 4592 states and 6582 transitions. [2018-11-10 05:13:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:22,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-11-10 05:13:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:22,126 INFO L225 Difference]: With dead ends: 4592 [2018-11-10 05:13:22,126 INFO L226 Difference]: Without dead ends: 2490 [2018-11-10 05:13:22,130 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 05:13:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2018-11-10 05:13:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2378. [2018-11-10 05:13:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-11-10 05:13:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3375 transitions. [2018-11-10 05:13:22,193 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3375 transitions. Word has length 146 [2018-11-10 05:13:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:22,194 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 3375 transitions. [2018-11-10 05:13:22,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3375 transitions. [2018-11-10 05:13:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 05:13:22,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:22,199 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:22,199 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:22,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1487171346, now seen corresponding path program 1 times [2018-11-10 05:13:22,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:22,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 05:13:22,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:22,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:22,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:22,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:22,257 INFO L87 Difference]: Start difference. First operand 2378 states and 3375 transitions. Second operand 3 states. [2018-11-10 05:13:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:22,415 INFO L93 Difference]: Finished difference Result 4962 states and 7001 transitions. [2018-11-10 05:13:22,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:22,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-11-10 05:13:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:22,427 INFO L225 Difference]: With dead ends: 4962 [2018-11-10 05:13:22,427 INFO L226 Difference]: Without dead ends: 2596 [2018-11-10 05:13:22,432 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 05:13:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2018-11-10 05:13:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2570. [2018-11-10 05:13:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2018-11-10 05:13:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3607 transitions. [2018-11-10 05:13:22,516 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3607 transitions. Word has length 183 [2018-11-10 05:13:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:22,517 INFO L481 AbstractCegarLoop]: Abstraction has 2570 states and 3607 transitions. [2018-11-10 05:13:22,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3607 transitions. [2018-11-10 05:13:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 05:13:22,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:22,524 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:22,524 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:22,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1615391006, now seen corresponding path program 1 times [2018-11-10 05:13:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-10 05:13:22,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:22,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:22,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:22,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:22,640 INFO L87 Difference]: Start difference. First operand 2570 states and 3607 transitions. Second operand 3 states. [2018-11-10 05:13:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:22,794 INFO L93 Difference]: Finished difference Result 5360 states and 7502 transitions. [2018-11-10 05:13:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-10 05:13:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:22,804 INFO L225 Difference]: With dead ends: 5360 [2018-11-10 05:13:22,805 INFO L226 Difference]: Without dead ends: 2802 [2018-11-10 05:13:22,809 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 05:13:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2018-11-10 05:13:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2778. [2018-11-10 05:13:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-10 05:13:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 3855 transitions. [2018-11-10 05:13:22,887 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 3855 transitions. Word has length 205 [2018-11-10 05:13:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:22,888 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 3855 transitions. [2018-11-10 05:13:22,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 3855 transitions. [2018-11-10 05:13:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 05:13:22,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:22,894 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:22,895 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:22,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash -261333060, now seen corresponding path program 1 times [2018-11-10 05:13:22,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:22,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:22,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:22,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-10 05:13:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:22,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:22,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:22,979 INFO L87 Difference]: Start difference. First operand 2778 states and 3855 transitions. Second operand 3 states. [2018-11-10 05:13:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:23,128 INFO L93 Difference]: Finished difference Result 5832 states and 8102 transitions. [2018-11-10 05:13:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:23,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-10 05:13:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:23,139 INFO L225 Difference]: With dead ends: 5832 [2018-11-10 05:13:23,139 INFO L226 Difference]: Without dead ends: 3066 [2018-11-10 05:13:23,144 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 05:13:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-11-10 05:13:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3042. [2018-11-10 05:13:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-11-10 05:13:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4159 transitions. [2018-11-10 05:13:23,218 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4159 transitions. Word has length 230 [2018-11-10 05:13:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:23,219 INFO L481 AbstractCegarLoop]: Abstraction has 3042 states and 4159 transitions. [2018-11-10 05:13:23,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4159 transitions. [2018-11-10 05:13:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 05:13:23,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:23,226 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:23,226 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:23,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1772060986, now seen corresponding path program 1 times [2018-11-10 05:13:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-10 05:13:23,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:23,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:23,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:23,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:23,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:23,301 INFO L87 Difference]: Start difference. First operand 3042 states and 4159 transitions. Second operand 3 states. [2018-11-10 05:13:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:23,452 INFO L93 Difference]: Finished difference Result 6312 states and 8622 transitions. [2018-11-10 05:13:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:23,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-10 05:13:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:23,464 INFO L225 Difference]: With dead ends: 6312 [2018-11-10 05:13:23,464 INFO L226 Difference]: Without dead ends: 3282 [2018-11-10 05:13:23,469 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 05:13:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2018-11-10 05:13:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3266. [2018-11-10 05:13:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2018-11-10 05:13:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4423 transitions. [2018-11-10 05:13:23,539 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4423 transitions. Word has length 230 [2018-11-10 05:13:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:23,539 INFO L481 AbstractCegarLoop]: Abstraction has 3266 states and 4423 transitions. [2018-11-10 05:13:23,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4423 transitions. [2018-11-10 05:13:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 05:13:23,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:23,546 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:23,547 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:23,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash -388473491, now seen corresponding path program 1 times [2018-11-10 05:13:23,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-10 05:13:23,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:23,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:23,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:23,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:23,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:23,656 INFO L87 Difference]: Start difference. First operand 3266 states and 4423 transitions. Second operand 3 states. [2018-11-10 05:13:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:23,784 INFO L93 Difference]: Finished difference Result 9478 states and 12805 transitions. [2018-11-10 05:13:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:23,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 05:13:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:23,806 INFO L225 Difference]: With dead ends: 9478 [2018-11-10 05:13:23,806 INFO L226 Difference]: Without dead ends: 6224 [2018-11-10 05:13:23,813 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 05:13:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2018-11-10 05:13:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6222. [2018-11-10 05:13:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2018-11-10 05:13:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 8389 transitions. [2018-11-10 05:13:23,957 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 8389 transitions. Word has length 261 [2018-11-10 05:13:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:23,958 INFO L481 AbstractCegarLoop]: Abstraction has 6222 states and 8389 transitions. [2018-11-10 05:13:23,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 8389 transitions. [2018-11-10 05:13:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 05:13:23,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:23,971 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:23,971 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:23,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1873099759, now seen corresponding path program 1 times [2018-11-10 05:13:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:23,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-10 05:13:24,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:24,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:24,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:24,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:24,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:24,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:24,057 INFO L87 Difference]: Start difference. First operand 6222 states and 8389 transitions. Second operand 3 states. [2018-11-10 05:13:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:24,249 INFO L93 Difference]: Finished difference Result 13040 states and 17466 transitions. [2018-11-10 05:13:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:24,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 05:13:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:24,264 INFO L225 Difference]: With dead ends: 13040 [2018-11-10 05:13:24,264 INFO L226 Difference]: Without dead ends: 6830 [2018-11-10 05:13:24,274 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 05:13:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2018-11-10 05:13:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 6798. [2018-11-10 05:13:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2018-11-10 05:13:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 9045 transitions. [2018-11-10 05:13:24,411 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 9045 transitions. Word has length 261 [2018-11-10 05:13:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:24,411 INFO L481 AbstractCegarLoop]: Abstraction has 6798 states and 9045 transitions. [2018-11-10 05:13:24,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 9045 transitions. [2018-11-10 05:13:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 05:13:24,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:24,424 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:24,424 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:24,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash -478208852, now seen corresponding path program 1 times [2018-11-10 05:13:24,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:24,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:24,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:24,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:24,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-11-10 05:13:24,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:24,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:24,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:24,526 INFO L87 Difference]: Start difference. First operand 6798 states and 9045 transitions. Second operand 3 states. [2018-11-10 05:13:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:24,716 INFO L93 Difference]: Finished difference Result 13608 states and 18090 transitions. [2018-11-10 05:13:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:24,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-11-10 05:13:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:24,730 INFO L225 Difference]: With dead ends: 13608 [2018-11-10 05:13:24,730 INFO L226 Difference]: Without dead ends: 6822 [2018-11-10 05:13:24,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 05:13:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2018-11-10 05:13:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 6790. [2018-11-10 05:13:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2018-11-10 05:13:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 8941 transitions. [2018-11-10 05:13:24,890 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 8941 transitions. Word has length 286 [2018-11-10 05:13:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:24,891 INFO L481 AbstractCegarLoop]: Abstraction has 6790 states and 8941 transitions. [2018-11-10 05:13:24,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 8941 transitions. [2018-11-10 05:13:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 05:13:24,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:24,904 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:24,904 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:24,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 818436740, now seen corresponding path program 1 times [2018-11-10 05:13:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:24,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:24,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-10 05:13:25,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:25,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:25,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:25,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:25,003 INFO L87 Difference]: Start difference. First operand 6790 states and 8941 transitions. Second operand 3 states. [2018-11-10 05:13:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:25,220 INFO L93 Difference]: Finished difference Result 14384 states and 19226 transitions. [2018-11-10 05:13:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:25,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-11-10 05:13:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:25,235 INFO L225 Difference]: With dead ends: 14384 [2018-11-10 05:13:25,235 INFO L226 Difference]: Without dead ends: 7606 [2018-11-10 05:13:25,246 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 05:13:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2018-11-10 05:13:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7430. [2018-11-10 05:13:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7430 states. [2018-11-10 05:13:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9693 transitions. [2018-11-10 05:13:25,365 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9693 transitions. Word has length 297 [2018-11-10 05:13:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:25,366 INFO L481 AbstractCegarLoop]: Abstraction has 7430 states and 9693 transitions. [2018-11-10 05:13:25,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9693 transitions. [2018-11-10 05:13:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-10 05:13:25,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:25,377 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:25,377 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1064296007, now seen corresponding path program 1 times [2018-11-10 05:13:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:25,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-10 05:13:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:25,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:25,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:25,472 INFO L87 Difference]: Start difference. First operand 7430 states and 9693 transitions. Second operand 3 states. [2018-11-10 05:13:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:25,682 INFO L93 Difference]: Finished difference Result 15672 states and 20338 transitions. [2018-11-10 05:13:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:25,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-11-10 05:13:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:25,697 INFO L225 Difference]: With dead ends: 15672 [2018-11-10 05:13:25,697 INFO L226 Difference]: Without dead ends: 8254 [2018-11-10 05:13:25,706 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 05:13:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2018-11-10 05:13:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 7678. [2018-11-10 05:13:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7678 states. [2018-11-10 05:13:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 9989 transitions. [2018-11-10 05:13:25,851 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 9989 transitions. Word has length 312 [2018-11-10 05:13:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:25,852 INFO L481 AbstractCegarLoop]: Abstraction has 7678 states and 9989 transitions. [2018-11-10 05:13:25,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 9989 transitions. [2018-11-10 05:13:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 05:13:25,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:25,863 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:25,863 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:25,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash 242465044, now seen corresponding path program 1 times [2018-11-10 05:13:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:25,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:25,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-11-10 05:13:26,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:26,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:26,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:26,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:26,049 INFO L87 Difference]: Start difference. First operand 7678 states and 9989 transitions. Second operand 3 states. [2018-11-10 05:13:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:26,118 INFO L93 Difference]: Finished difference Result 12148 states and 15759 transitions. [2018-11-10 05:13:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:26,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-10 05:13:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:26,129 INFO L225 Difference]: With dead ends: 12148 [2018-11-10 05:13:26,129 INFO L226 Difference]: Without dead ends: 8230 [2018-11-10 05:13:26,133 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 05:13:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2018-11-10 05:13:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 8228. [2018-11-10 05:13:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8228 states. [2018-11-10 05:13:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 10671 transitions. [2018-11-10 05:13:26,222 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 10671 transitions. Word has length 313 [2018-11-10 05:13:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:26,223 INFO L481 AbstractCegarLoop]: Abstraction has 8228 states and 10671 transitions. [2018-11-10 05:13:26,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 10671 transitions. [2018-11-10 05:13:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-10 05:13:26,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:26,228 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:26,229 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -700783518, now seen corresponding path program 1 times [2018-11-10 05:13:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:26,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-10 05:13:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:13:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:13:26,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:26,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:13:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:13:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:13:26,305 INFO L87 Difference]: Start difference. First operand 8228 states and 10671 transitions. Second operand 3 states. [2018-11-10 05:13:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:26,452 INFO L93 Difference]: Finished difference Result 15999 states and 20730 transitions. [2018-11-10 05:13:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:13:26,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-10 05:13:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:26,461 INFO L225 Difference]: With dead ends: 15999 [2018-11-10 05:13:26,461 INFO L226 Difference]: Without dead ends: 8231 [2018-11-10 05:13:26,468 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 05:13:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8231 states. [2018-11-10 05:13:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8231 to 8197. [2018-11-10 05:13:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8197 states. [2018-11-10 05:13:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 10567 transitions. [2018-11-10 05:13:26,552 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 10567 transitions. Word has length 314 [2018-11-10 05:13:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:26,553 INFO L481 AbstractCegarLoop]: Abstraction has 8197 states and 10567 transitions. [2018-11-10 05:13:26,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:13:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 10567 transitions. [2018-11-10 05:13:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-10 05:13:26,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:26,559 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:26,559 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:26,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1845363507, now seen corresponding path program 1 times [2018-11-10 05:13:26,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:26,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 677 proven. 15 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-10 05:13:26,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:13:26,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:13:26,654 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-10 05:13:26,656 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [260], [263], [268], [271], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 05:13:26,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:13:26,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:13:27,576 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:13:27,577 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 05:13:27,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:27,588 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:13:29,363 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 75.45% of their original sizes. [2018-11-10 05:13:29,363 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:13:30,733 INFO L415 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2018-11-10 05:13:30,734 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:13:30,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:13:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-10 05:13:30,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:13:30,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:13:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:13:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:13:30,736 INFO L87 Difference]: Start difference. First operand 8197 states and 10567 transitions. Second operand 14 states. [2018-11-10 05:13:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:13:36,577 INFO L93 Difference]: Finished difference Result 16387 states and 21124 transitions. [2018-11-10 05:13:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:13:36,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 337 [2018-11-10 05:13:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:13:36,591 INFO L225 Difference]: With dead ends: 16387 [2018-11-10 05:13:36,591 INFO L226 Difference]: Without dead ends: 8202 [2018-11-10 05:13:36,600 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:13:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8202 states. [2018-11-10 05:13:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8202 to 8201. [2018-11-10 05:13:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8201 states. [2018-11-10 05:13:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 10571 transitions. [2018-11-10 05:13:36,754 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 10571 transitions. Word has length 337 [2018-11-10 05:13:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:13:36,754 INFO L481 AbstractCegarLoop]: Abstraction has 8201 states and 10571 transitions. [2018-11-10 05:13:36,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:13:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 10571 transitions. [2018-11-10 05:13:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-10 05:13:36,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:13:36,762 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:36,762 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:13:36,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1601090738, now seen corresponding path program 1 times [2018-11-10 05:13:36,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:13:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:36,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:13:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-10 05:13:36,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:13:36,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:13:36,894 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 352 with the following transitions: [2018-11-10 05:13:36,894 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 05:13:36,899 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:13:36,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:13:39,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:15:35,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:15:35,988 INFO L272 AbstractInterpreter]: Visited 111 different actions 3730 times. Merged at 101 different actions 3176 times. Widened at 25 different actions 453 times. Found 430 fixpoints after 33 different actions. Largest state had 105 variables. [2018-11-10 05:15:35,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:15:35,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:15:35,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:15:35,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/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 05:15:35,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:15:35,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:15:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:15:36,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:15:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-10 05:15:36,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:15:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-10 05:15:36,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:15:36,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 05:15:36,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:15:36,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:15:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:15:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:15:36,234 INFO L87 Difference]: Start difference. First operand 8201 states and 10571 transitions. Second operand 4 states. [2018-11-10 05:15:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:15:36,511 INFO L93 Difference]: Finished difference Result 13515 states and 17305 transitions. [2018-11-10 05:15:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:15:36,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-11-10 05:15:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:15:36,521 INFO L225 Difference]: With dead ends: 13515 [2018-11-10 05:15:36,521 INFO L226 Difference]: Without dead ends: 9773 [2018-11-10 05:15:36,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 702 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 05:15:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2018-11-10 05:15:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 8342. [2018-11-10 05:15:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2018-11-10 05:15:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 10572 transitions. [2018-11-10 05:15:36,645 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 10572 transitions. Word has length 351 [2018-11-10 05:15:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:15:36,645 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 10572 transitions. [2018-11-10 05:15:36,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:15:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 10572 transitions. [2018-11-10 05:15:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-10 05:15:36,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:15:36,653 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:15:36,653 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:15:36,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:15:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -702707181, now seen corresponding path program 2 times [2018-11-10 05:15:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:15:36,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:15:36,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:15:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:15:36,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:15:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:15:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 770 proven. 6 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-10 05:15:36,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:15:36,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:15:36,750 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:15:36,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:15:36,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:15:36,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/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 05:15:36,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:15:36,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:15:36,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 05:15:36,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:15:36,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:15:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-11-10 05:15:36,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:15:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-11-10 05:15:36,945 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:15:36,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-10 05:15:36,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:15:36,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:15:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:15:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:15:36,947 INFO L87 Difference]: Start difference. First operand 8342 states and 10572 transitions. Second operand 3 states. [2018-11-10 05:15:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:15:37,115 INFO L93 Difference]: Finished difference Result 15694 states and 19574 transitions. [2018-11-10 05:15:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:15:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-10 05:15:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:15:37,123 INFO L225 Difference]: With dead ends: 15694 [2018-11-10 05:15:37,123 INFO L226 Difference]: Without dead ends: 7368 [2018-11-10 05:15:37,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:15:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2018-11-10 05:15:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7342. [2018-11-10 05:15:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-10 05:15:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 8971 transitions. [2018-11-10 05:15:37,241 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 8971 transitions. Word has length 365 [2018-11-10 05:15:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:15:37,241 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 8971 transitions. [2018-11-10 05:15:37,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:15:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 8971 transitions. [2018-11-10 05:15:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-10 05:15:37,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:15:37,247 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:15:37,247 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:15:37,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:15:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2052993450, now seen corresponding path program 1 times [2018-11-10 05:15:37,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:15:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:15:37,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:15:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:15:37,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:15:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:15:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 05:15:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:15:37,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:15:37,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-11-10 05:15:37,353 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 05:15:37,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:15:37,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:15:39,439 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:17:30,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:17:30,676 INFO L272 AbstractInterpreter]: Visited 113 different actions 3999 times. Merged at 103 different actions 3353 times. Widened at 25 different actions 463 times. Found 512 fixpoints after 42 different actions. Largest state had 105 variables. [2018-11-10 05:17:30,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:30,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:17:30,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:17:30,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/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 05:17:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:30,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:17:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:30,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 05:17:30,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:17:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 05:17:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:17:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 05:17:30,878 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:17:30,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:17:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:17:30,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:17:30,879 INFO L87 Difference]: Start difference. First operand 7342 states and 8971 transitions. Second operand 4 states. [2018-11-10 05:17:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:17:31,166 INFO L93 Difference]: Finished difference Result 16047 states and 19502 transitions. [2018-11-10 05:17:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:17:31,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-11-10 05:17:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:17:31,179 INFO L225 Difference]: With dead ends: 16047 [2018-11-10 05:17:31,180 INFO L226 Difference]: Without dead ends: 8789 [2018-11-10 05:17:31,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 796 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 05:17:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8789 states. [2018-11-10 05:17:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8789 to 7310. [2018-11-10 05:17:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2018-11-10 05:17:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 8875 transitions. [2018-11-10 05:17:31,309 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 8875 transitions. Word has length 398 [2018-11-10 05:17:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:17:31,310 INFO L481 AbstractCegarLoop]: Abstraction has 7310 states and 8875 transitions. [2018-11-10 05:17:31,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:17:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 8875 transitions. [2018-11-10 05:17:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-11-10 05:17:31,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:17:31,317 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:31,318 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:17:31,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash -949119215, now seen corresponding path program 1 times [2018-11-10 05:17:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:17:31,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:31,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:31,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:31,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:17:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-10 05:17:31,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:17:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:17:31,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:17:31,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:17:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:17:31,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:17:31,461 INFO L87 Difference]: Start difference. First operand 7310 states and 8875 transitions. Second operand 3 states. [2018-11-10 05:17:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:17:31,587 INFO L93 Difference]: Finished difference Result 13243 states and 15988 transitions. [2018-11-10 05:17:31,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:17:31,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-11-10 05:17:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:17:31,593 INFO L225 Difference]: With dead ends: 13243 [2018-11-10 05:17:31,593 INFO L226 Difference]: Without dead ends: 3666 [2018-11-10 05:17:31,600 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 05:17:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2018-11-10 05:17:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3591. [2018-11-10 05:17:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3591 states. [2018-11-10 05:17:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 4412 transitions. [2018-11-10 05:17:31,662 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 4412 transitions. Word has length 438 [2018-11-10 05:17:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:17:31,662 INFO L481 AbstractCegarLoop]: Abstraction has 3591 states and 4412 transitions. [2018-11-10 05:17:31,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:17:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 4412 transitions. [2018-11-10 05:17:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-10 05:17:31,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:17:31,667 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:31,667 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:17:31,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1782371145, now seen corresponding path program 1 times [2018-11-10 05:17:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:17:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:31,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:17:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-10 05:17:31,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:17:31,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:17:31,853 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 506 with the following transitions: [2018-11-10 05:17:31,854 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [282], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 05:17:31,857 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:17:31,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:17:33,774 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:19:17,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:19:17,690 INFO L272 AbstractInterpreter]: Visited 117 different actions 3838 times. Merged at 103 different actions 3256 times. Widened at 23 different actions 465 times. Found 455 fixpoints after 32 different actions. Largest state had 106 variables. [2018-11-10 05:19:17,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:19:17,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:19:17,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:19:17,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/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 05:19:17,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:19:17,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:19:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:19:17,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:19:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-10 05:19:17,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:19:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-10 05:19:18,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:19:18,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 05:19:18,021 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:19:18,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:19:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:19:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:19:18,022 INFO L87 Difference]: Start difference. First operand 3591 states and 4412 transitions. Second operand 4 states. [2018-11-10 05:19:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:19:18,123 INFO L93 Difference]: Finished difference Result 4100 states and 5049 transitions. [2018-11-10 05:19:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:19:18,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-11-10 05:19:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:19:18,123 INFO L225 Difference]: With dead ends: 4100 [2018-11-10 05:19:18,123 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:19:18,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1010 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 05:19:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:19:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:19:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:19:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:19:18,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-11-10 05:19:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:19:18,129 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:19:18,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:19:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:19:18,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:19:18,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:19:18,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:19:18,550 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 91 [2018-11-10 05:19:18,658 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-11-10 05:19:19,263 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-10 05:19:19,284 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:19:19,284 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-10 05:19:19,284 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 05:19:19,284 INFO L421 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-11-10 05:19:19,284 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L421 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L421 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-10 05:19:19,285 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L421 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L421 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-10 05:19:19,286 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-10 05:19:19,287 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-11-10 05:19:19,288 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (not (= ssl3_connect_~s__hit~0 0)) (<= ssl3_connect_~s__state~0 4560)))) [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (<= ssl3_connect_~s__state~0 3)) (.cse5 (not .cse1)) (.cse7 (<= ssl3_connect_~blastFlag~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (= ssl3_connect_~s__state~0 4512)) (.cse9 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4384))) (or (and .cse0 (= ssl3_connect_~s__state~0 4400) .cse1) (and .cse2 .cse3 .cse1) (and .cse0 .cse4 .cse5 .cse6) (and (= ssl3_connect_~s__state~0 4464) .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4448) .cse3 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4368)) (and .cse8 .cse9 .cse3 .cse10) (and .cse0 .cse11) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (= ssl3_connect_~s__state~0 4416) .cse3 .cse1) (and .cse9 .cse4 .cse3 .cse1 .cse6 .cse10) (and (= ssl3_connect_~s__state~0 4432) .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4496) .cse3 .cse1) (and .cse8 .cse9 .cse5) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse12 .cse13 .cse5) (and .cse14 .cse7) (and .cse0 .cse2) (and .cse9 .cse12 .cse13 .cse3 .cse1 .cse10) (and .cse11 .cse3 .cse1) (and .cse3 .cse1 (= ssl3_connect_~s__state~0 4480)) (and .cse14 (= ssl3_connect_~blastFlag~0 1))))) [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-10 05:19:19,288 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-11-10 05:19:19,288 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-11-10 05:19:19,289 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse1) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-11-10 05:19:19,290 INFO L421 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-10 05:19:19,290 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560))) [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-10 05:19:19,290 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-10 05:19:19,290 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-11-10 05:19:19,290 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (= main_~s~0 12292) [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-10 05:19:19,291 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-10 05:19:19,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:19:19 BoogieIcfgContainer [2018-11-10 05:19:19,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:19:19,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:19:19,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:19:19,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:19:19,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:19" (3/4) ... [2018-11-10 05:19:19,313 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:19:19,318 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:19:19,318 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 05:19:19,318 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:19:19,326 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 05:19:19,328 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 05:19:19,328 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:19:19,350 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (blastFlag <= 0 && 4560 <= s__state) || !(\old(initial_state) == 12292) [2018-11-10 05:19:19,350 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state <= 4560) [2018-11-10 05:19:19,350 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4528)) || !(\old(initial_state) == 12292)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__state == 4384 && blastFlag <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || (s__state == 4384 && blastFlag == 1) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) [2018-11-10 05:19:19,351 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 05:19:19,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-11-10 05:19:19,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-10 05:19:19,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 05:19:19,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) [2018-11-10 05:19:19,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 05:19:19,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 05:19:19,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) [2018-11-10 05:19:19,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-10 05:19:19,398 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_406af82c-2f16-4e43-9591-d1a5b8826a6a/bin-2019/utaipan/witness.graphml [2018-11-10 05:19:19,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:19:19,399 INFO L168 Benchmark]: Toolchain (without parser) took 360963.42 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 960.3 MB in the beginning and 989.0 MB in the end (delta: -28.7 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,400 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:19:19,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.49 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 941.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,400 INFO L168 Benchmark]: Boogie Preprocessor took 82.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,401 INFO L168 Benchmark]: RCFGBuilder took 591.34 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,401 INFO L168 Benchmark]: TraceAbstraction took 359881.39 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 989.0 MB in the end (delta: 109.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 05:19:19,401 INFO L168 Benchmark]: Witness Printer took 89.99 ms. Allocated memory is still 5.1 GB. Free memory is still 989.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:19:19,402 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.49 ms. Allocated memory is still 1.0 GB. Free memory was 944.2 MB in the beginning and 941.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 591.34 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 359881.39 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 989.0 MB in the end (delta: 109.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 89.99 ms. Allocated memory is still 5.1 GB. Free memory is still 989.0 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: ((((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state <= 4560) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (blastFlag <= 0 && 4560 <= s__state) || !(\old(initial_state) == 12292) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4528)) || !(\old(initial_state) == 12292)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__state == 4384 && blastFlag <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || (s__state == 4384 && blastFlag == 1) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 359.8s OverallTime, 29 OverallIterations, 18 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 5978 SDtfs, 1993 SDslu, 3786 SDs, 0 SdLazy, 2940 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3666 GetRequests, 3610 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8342occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 339.1s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9947411003236248 AbsIntWeakeningRatio, 0.41369047619047616 AbsIntAvgWeakeningVarsNumRemoved, 400.98809523809524 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 4160 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 577 HoareAnnotationTreeSize, 26 FomulaSimplifications, 19680 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1769 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 7883 NumberOfCodeBlocks, 7604 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9465 ConstructedInterpolants, 0 QuantifiedInterpolants, 3960130 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2568 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 35170/35299 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...