./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.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_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 c53759a150934ef20fe7ff264c4326cfaaab3702 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:13:27,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:13:27,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:13:27,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:13:27,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:13:27,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:13:27,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:13:27,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:13:27,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:13:27,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:13:27,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:13:27,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:13:27,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:13:27,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:13:27,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:13:27,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:13:27,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:13:27,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:13:27,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:13:27,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:13:27,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:13:27,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:13:27,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:13:27,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:13:27,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:13:27,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:13:27,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:13:27,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:13:27,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:13:27,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:13:27,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:13:27,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:13:27,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:13:27,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:13:27,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:13:27,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:13:27,387 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:13:27,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:13:27,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:13:27,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:13:27,398 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:13:27,398 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:13:27,398 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:13:27,398 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:13:27,399 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:13:27,399 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:13:27,399 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:13:27,399 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:13:27,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:13:27,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:13:27,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:13:27,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:13:27,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:13:27,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:13:27,402 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:13:27,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:13:27,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:13:27,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:13:27,402 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_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 -> c53759a150934ef20fe7ff264c4326cfaaab3702 [2018-11-10 09:13:27,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:13:27,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:13:27,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:13:27,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:13:27,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:13:27,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 09:13:27,489 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/data/1fc2cc4b2/d4002b0ff59e4bc68bdec81139e9220c/FLAGb770fa662 [2018-11-10 09:13:27,853 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:13:27,854 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 09:13:27,863 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/data/1fc2cc4b2/d4002b0ff59e4bc68bdec81139e9220c/FLAGb770fa662 [2018-11-10 09:13:27,876 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/data/1fc2cc4b2/d4002b0ff59e4bc68bdec81139e9220c [2018-11-10 09:13:27,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:13:27,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:13:27,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:13:27,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:13:27,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:13:27,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:27" (1/1) ... [2018-11-10 09:13:27,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b68c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:27, skipping insertion in model container [2018-11-10 09:13:27,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:27" (1/1) ... [2018-11-10 09:13:27,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:13:27,931 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:13:28,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:13:28,100 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:13:28,133 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:13:28,141 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:13:28,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28 WrapperNode [2018-11-10 09:13:28,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:13:28,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:13:28,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:13:28,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:13:28,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:13:28,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:13:28,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:13:28,157 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:13:28,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2018-11-10 09:13:28,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:13:28,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:13:28,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:13:28,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:13:28,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 09:13:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:13:28,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:13:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:13:28,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:13:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 09:13:28,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 09:13:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:13:28,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:13:28,375 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:13:28,375 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:13:28,717 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:13:28,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:13:28 BoogieIcfgContainer [2018-11-10 09:13:28,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:13:28,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:13:28,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:13:28,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:13:28,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:13:27" (1/3) ... [2018-11-10 09:13:28,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4702bbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:28, skipping insertion in model container [2018-11-10 09:13:28,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (2/3) ... [2018-11-10 09:13:28,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4702bbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:28, skipping insertion in model container [2018-11-10 09:13:28,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:13:28" (3/3) ... [2018-11-10 09:13:28,723 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 09:13:28,729 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:13:28,735 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:13:28,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:13:28,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:13:28,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:13:28,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:13:28,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:13:28,770 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:13:28,770 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:13:28,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:13:28,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:13:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-11-10 09:13:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:13:28,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:28,792 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, 1] [2018-11-10 09:13:28,794 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:28,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1793961723, now seen corresponding path program 1 times [2018-11-10 09:13:28,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:28,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:28,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:28,938 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 09:13:28,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:28,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:28,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:28,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:28,955 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-11-10 09:13:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,105 INFO L93 Difference]: Finished difference Result 261 states and 437 transitions. [2018-11-10 09:13:29,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 09:13:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,116 INFO L225 Difference]: With dead ends: 261 [2018-11-10 09:13:29,116 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 09:13:29,119 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 09:13:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 09:13:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-10 09:13:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 09:13:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2018-11-10 09:13:29,153 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 31 [2018-11-10 09:13:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,153 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2018-11-10 09:13:29,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2018-11-10 09:13:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:13:29,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,155 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 09:13:29,155 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1894219512, now seen corresponding path program 1 times [2018-11-10 09:13:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:13:29,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:29,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:29,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:29,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:29,215 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand 3 states. [2018-11-10 09:13:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,324 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2018-11-10 09:13:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 09:13:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,326 INFO L225 Difference]: With dead ends: 242 [2018-11-10 09:13:29,326 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 09:13:29,327 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 09:13:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 09:13:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-11-10 09:13:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 09:13:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2018-11-10 09:13:29,333 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 44 [2018-11-10 09:13:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,333 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2018-11-10 09:13:29,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2018-11-10 09:13:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:13:29,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,334 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-10 09:13:29,335 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 779443730, now seen corresponding path program 1 times [2018-11-10 09:13:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:13:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:29,392 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:29,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:29,393 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand 3 states. [2018-11-10 09:13:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,491 INFO L93 Difference]: Finished difference Result 277 states and 413 transitions. [2018-11-10 09:13:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-10 09:13:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,493 INFO L225 Difference]: With dead ends: 277 [2018-11-10 09:13:29,493 INFO L226 Difference]: Without dead ends: 158 [2018-11-10 09:13:29,493 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 09:13:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-10 09:13:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-11-10 09:13:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 09:13:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2018-11-10 09:13:29,500 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 59 [2018-11-10 09:13:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,501 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2018-11-10 09:13:29,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2018-11-10 09:13:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 09:13:29,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,502 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 09:13:29,502 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2088419485, now seen corresponding path program 1 times [2018-11-10 09:13:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:13:29,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:29,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:29,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:29,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:29,567 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand 3 states. [2018-11-10 09:13:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,614 INFO L93 Difference]: Finished difference Result 431 states and 624 transitions. [2018-11-10 09:13:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 09:13:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,616 INFO L225 Difference]: With dead ends: 431 [2018-11-10 09:13:29,616 INFO L226 Difference]: Without dead ends: 294 [2018-11-10 09:13:29,617 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 09:13:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-10 09:13:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-11-10 09:13:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-10 09:13:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2018-11-10 09:13:29,630 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 77 [2018-11-10 09:13:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,630 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2018-11-10 09:13:29,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2018-11-10 09:13:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 09:13:29,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,633 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 09:13:29,633 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1954405979, now seen corresponding path program 1 times [2018-11-10 09:13:29,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:13:29,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:29,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:29,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:29,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:29,697 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand 3 states. [2018-11-10 09:13:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,746 INFO L93 Difference]: Finished difference Result 832 states and 1207 transitions. [2018-11-10 09:13:29,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 09:13:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,750 INFO L225 Difference]: With dead ends: 832 [2018-11-10 09:13:29,750 INFO L226 Difference]: Without dead ends: 561 [2018-11-10 09:13:29,752 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 09:13:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-10 09:13:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-11-10 09:13:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-10 09:13:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 807 transitions. [2018-11-10 09:13:29,775 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 807 transitions. Word has length 77 [2018-11-10 09:13:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,775 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 807 transitions. [2018-11-10 09:13:29,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 807 transitions. [2018-11-10 09:13:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 09:13:29,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,779 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-10 09:13:29,779 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1539543640, now seen corresponding path program 1 times [2018-11-10 09:13:29,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 09:13:29,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:29,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:29,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:29,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:29,841 INFO L87 Difference]: Start difference. First operand 561 states and 807 transitions. Second operand 3 states. [2018-11-10 09:13:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:29,945 INFO L93 Difference]: Finished difference Result 1201 states and 1758 transitions. [2018-11-10 09:13:29,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:29,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-10 09:13:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:29,948 INFO L225 Difference]: With dead ends: 1201 [2018-11-10 09:13:29,948 INFO L226 Difference]: Without dead ends: 661 [2018-11-10 09:13:29,949 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 09:13:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-10 09:13:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 649. [2018-11-10 09:13:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-11-10 09:13:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 915 transitions. [2018-11-10 09:13:29,966 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 915 transitions. Word has length 96 [2018-11-10 09:13:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:29,966 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 915 transitions. [2018-11-10 09:13:29,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 915 transitions. [2018-11-10 09:13:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 09:13:29,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:29,969 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:13:29,970 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:29,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1105441981, now seen corresponding path program 1 times [2018-11-10 09:13:29,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:29,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:29,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:29,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 09:13:30,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,032 INFO L87 Difference]: Start difference. First operand 649 states and 915 transitions. Second operand 3 states. [2018-11-10 09:13:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:30,068 INFO L93 Difference]: Finished difference Result 964 states and 1363 transitions. [2018-11-10 09:13:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:30,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-10 09:13:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:30,071 INFO L225 Difference]: With dead ends: 964 [2018-11-10 09:13:30,072 INFO L226 Difference]: Without dead ends: 962 [2018-11-10 09:13:30,072 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 09:13:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-11-10 09:13:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2018-11-10 09:13:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-11-10 09:13:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1360 transitions. [2018-11-10 09:13:30,087 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1360 transitions. Word has length 117 [2018-11-10 09:13:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:30,087 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1360 transitions. [2018-11-10 09:13:30,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1360 transitions. [2018-11-10 09:13:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 09:13:30,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:30,089 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2018-11-10 09:13:30,089 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:30,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -642399451, now seen corresponding path program 1 times [2018-11-10 09:13:30,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 09:13:30,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,129 INFO L87 Difference]: Start difference. First operand 962 states and 1360 transitions. Second operand 3 states. [2018-11-10 09:13:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:30,251 INFO L93 Difference]: Finished difference Result 2203 states and 3222 transitions. [2018-11-10 09:13:30,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:30,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-11-10 09:13:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:30,255 INFO L225 Difference]: With dead ends: 2203 [2018-11-10 09:13:30,255 INFO L226 Difference]: Without dead ends: 1256 [2018-11-10 09:13:30,256 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 09:13:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-11-10 09:13:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1208. [2018-11-10 09:13:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-10 09:13:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1756 transitions. [2018-11-10 09:13:30,275 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1756 transitions. Word has length 136 [2018-11-10 09:13:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:30,275 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1756 transitions. [2018-11-10 09:13:30,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1756 transitions. [2018-11-10 09:13:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 09:13:30,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:30,277 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:30,278 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:30,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1110967660, now seen corresponding path program 1 times [2018-11-10 09:13:30,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-10 09:13:30,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,334 INFO L87 Difference]: Start difference. First operand 1208 states and 1756 transitions. Second operand 3 states. [2018-11-10 09:13:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:30,452 INFO L93 Difference]: Finished difference Result 2961 states and 4431 transitions. [2018-11-10 09:13:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:30,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-10 09:13:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:30,456 INFO L225 Difference]: With dead ends: 2961 [2018-11-10 09:13:30,456 INFO L226 Difference]: Without dead ends: 1672 [2018-11-10 09:13:30,458 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 09:13:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-11-10 09:13:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1598. [2018-11-10 09:13:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-11-10 09:13:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2272 transitions. [2018-11-10 09:13:30,482 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2272 transitions. Word has length 164 [2018-11-10 09:13:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:30,482 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 2272 transitions. [2018-11-10 09:13:30,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2272 transitions. [2018-11-10 09:13:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 09:13:30,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:30,485 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 09:13:30,485 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:30,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1540071454, now seen corresponding path program 1 times [2018-11-10 09:13:30,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:30,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:30,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-10 09:13:30,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,535 INFO L87 Difference]: Start difference. First operand 1598 states and 2272 transitions. Second operand 3 states. [2018-11-10 09:13:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:30,656 INFO L93 Difference]: Finished difference Result 3493 states and 5004 transitions. [2018-11-10 09:13:30,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:30,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-11-10 09:13:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:30,660 INFO L225 Difference]: With dead ends: 3493 [2018-11-10 09:13:30,660 INFO L226 Difference]: Without dead ends: 1826 [2018-11-10 09:13:30,662 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 09:13:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-11-10 09:13:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1754. [2018-11-10 09:13:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-11-10 09:13:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2470 transitions. [2018-11-10 09:13:30,687 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2470 transitions. Word has length 186 [2018-11-10 09:13:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:30,687 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 2470 transitions. [2018-11-10 09:13:30,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2470 transitions. [2018-11-10 09:13:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 09:13:30,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:30,690 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-11-10 09:13:30,690 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:30,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash -148829878, now seen corresponding path program 1 times [2018-11-10 09:13:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 09:13:30,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,747 INFO L87 Difference]: Start difference. First operand 1754 states and 2470 transitions. Second operand 3 states. [2018-11-10 09:13:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:30,889 INFO L93 Difference]: Finished difference Result 3805 states and 5394 transitions. [2018-11-10 09:13:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:30,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-10 09:13:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:30,895 INFO L225 Difference]: With dead ends: 3805 [2018-11-10 09:13:30,895 INFO L226 Difference]: Without dead ends: 1994 [2018-11-10 09:13:30,897 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 09:13:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-11-10 09:13:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1928. [2018-11-10 09:13:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-10 09:13:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2698 transitions. [2018-11-10 09:13:30,931 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2698 transitions. Word has length 211 [2018-11-10 09:13:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:30,932 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2698 transitions. [2018-11-10 09:13:30,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2698 transitions. [2018-11-10 09:13:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 09:13:30,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:30,935 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-11-10 09:13:30,935 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:30,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1116180532, now seen corresponding path program 1 times [2018-11-10 09:13:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:30,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 09:13:30,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:30,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:30,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:30,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:30,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:30,987 INFO L87 Difference]: Start difference. First operand 1928 states and 2698 transitions. Second operand 3 states. [2018-11-10 09:13:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:31,130 INFO L93 Difference]: Finished difference Result 4153 states and 5856 transitions. [2018-11-10 09:13:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:31,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-10 09:13:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:31,135 INFO L225 Difference]: With dead ends: 4153 [2018-11-10 09:13:31,135 INFO L226 Difference]: Without dead ends: 2192 [2018-11-10 09:13:31,137 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 09:13:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-11-10 09:13:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2120. [2018-11-10 09:13:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-10 09:13:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2968 transitions. [2018-11-10 09:13:31,176 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2968 transitions. Word has length 211 [2018-11-10 09:13:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:31,176 INFO L481 AbstractCegarLoop]: Abstraction has 2120 states and 2968 transitions. [2018-11-10 09:13:31,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2968 transitions. [2018-11-10 09:13:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 09:13:31,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:31,180 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:13:31,180 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:31,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash 971581549, now seen corresponding path program 1 times [2018-11-10 09:13:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 09:13:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:31,264 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:31,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:31,265 INFO L87 Difference]: Start difference. First operand 2120 states and 2968 transitions. Second operand 3 states. [2018-11-10 09:13:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:31,309 INFO L93 Difference]: Finished difference Result 6312 states and 8846 transitions. [2018-11-10 09:13:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:31,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-11-10 09:13:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:31,318 INFO L225 Difference]: With dead ends: 6312 [2018-11-10 09:13:31,318 INFO L226 Difference]: Without dead ends: 4213 [2018-11-10 09:13:31,322 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 09:13:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2018-11-10 09:13:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4211. [2018-11-10 09:13:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4211 states. [2018-11-10 09:13:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5897 transitions. [2018-11-10 09:13:31,389 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5897 transitions. Word has length 242 [2018-11-10 09:13:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:31,390 INFO L481 AbstractCegarLoop]: Abstraction has 4211 states and 5897 transitions. [2018-11-10 09:13:31,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5897 transitions. [2018-11-10 09:13:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 09:13:31,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:31,394 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:13:31,395 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:31,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash 4230895, now seen corresponding path program 1 times [2018-11-10 09:13:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-10 09:13:31,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:31,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:31,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:31,459 INFO L87 Difference]: Start difference. First operand 4211 states and 5897 transitions. Second operand 3 states. [2018-11-10 09:13:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:31,596 INFO L93 Difference]: Finished difference Result 9025 states and 12716 transitions. [2018-11-10 09:13:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:31,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-11-10 09:13:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:31,605 INFO L225 Difference]: With dead ends: 9025 [2018-11-10 09:13:31,605 INFO L226 Difference]: Without dead ends: 4775 [2018-11-10 09:13:31,609 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 09:13:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2018-11-10 09:13:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4643. [2018-11-10 09:13:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4643 states. [2018-11-10 09:13:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6533 transitions. [2018-11-10 09:13:31,667 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6533 transitions. Word has length 242 [2018-11-10 09:13:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:31,667 INFO L481 AbstractCegarLoop]: Abstraction has 4643 states and 6533 transitions. [2018-11-10 09:13:31,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6533 transitions. [2018-11-10 09:13:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-10 09:13:31,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:31,672 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:31,672 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:31,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -36215738, now seen corresponding path program 1 times [2018-11-10 09:13:31,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-11-10 09:13:31,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:31,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:31,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:31,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:31,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:31,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:31,747 INFO L87 Difference]: Start difference. First operand 4643 states and 6533 transitions. Second operand 3 states. [2018-11-10 09:13:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:31,888 INFO L93 Difference]: Finished difference Result 9397 states and 13196 transitions. [2018-11-10 09:13:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:31,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-10 09:13:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:31,898 INFO L225 Difference]: With dead ends: 9397 [2018-11-10 09:13:31,898 INFO L226 Difference]: Without dead ends: 4739 [2018-11-10 09:13:31,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2018-11-10 09:13:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4607. [2018-11-10 09:13:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2018-11-10 09:13:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6425 transitions. [2018-11-10 09:13:31,958 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6425 transitions. Word has length 278 [2018-11-10 09:13:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:31,958 INFO L481 AbstractCegarLoop]: Abstraction has 4607 states and 6425 transitions. [2018-11-10 09:13:31,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6425 transitions. [2018-11-10 09:13:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-10 09:13:31,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:31,963 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:13:31,964 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:31,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 265020415, now seen corresponding path program 1 times [2018-11-10 09:13:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:31,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:31,965 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:13:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:32,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:32,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:32,021 INFO L87 Difference]: Start difference. First operand 4607 states and 6425 transitions. Second operand 3 states. [2018-11-10 09:13:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:32,142 INFO L93 Difference]: Finished difference Result 9301 states and 12956 transitions. [2018-11-10 09:13:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:32,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-10 09:13:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:32,152 INFO L225 Difference]: With dead ends: 9301 [2018-11-10 09:13:32,153 INFO L226 Difference]: Without dead ends: 4715 [2018-11-10 09:13:32,160 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 09:13:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2018-11-10 09:13:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4607. [2018-11-10 09:13:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2018-11-10 09:13:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6317 transitions. [2018-11-10 09:13:32,227 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6317 transitions. Word has length 287 [2018-11-10 09:13:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:32,227 INFO L481 AbstractCegarLoop]: Abstraction has 4607 states and 6317 transitions. [2018-11-10 09:13:32,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6317 transitions. [2018-11-10 09:13:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-10 09:13:32,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:32,233 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:32,233 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:32,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash -655131460, now seen corresponding path program 1 times [2018-11-10 09:13:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 09:13:32,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:32,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:32,320 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:32,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:32,320 INFO L87 Difference]: Start difference. First operand 4607 states and 6317 transitions. Second operand 3 states. [2018-11-10 09:13:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:32,440 INFO L93 Difference]: Finished difference Result 9799 states and 13322 transitions. [2018-11-10 09:13:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:32,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-11-10 09:13:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:32,447 INFO L225 Difference]: With dead ends: 9799 [2018-11-10 09:13:32,447 INFO L226 Difference]: Without dead ends: 5213 [2018-11-10 09:13:32,451 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 09:13:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2018-11-10 09:13:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 4793. [2018-11-10 09:13:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4793 states. [2018-11-10 09:13:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 6563 transitions. [2018-11-10 09:13:32,501 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 6563 transitions. Word has length 316 [2018-11-10 09:13:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:32,501 INFO L481 AbstractCegarLoop]: Abstraction has 4793 states and 6563 transitions. [2018-11-10 09:13:32,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 6563 transitions. [2018-11-10 09:13:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-10 09:13:32,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:32,506 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:32,507 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:32,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 666255515, now seen corresponding path program 1 times [2018-11-10 09:13:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 09:13:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:13:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:13:32,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:13:32,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:13:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:13:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:13:32,569 INFO L87 Difference]: Start difference. First operand 4793 states and 6563 transitions. Second operand 3 states. [2018-11-10 09:13:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:13:32,677 INFO L93 Difference]: Finished difference Result 9889 states and 13424 transitions. [2018-11-10 09:13:32,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:13:32,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-11-10 09:13:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:13:32,683 INFO L225 Difference]: With dead ends: 9889 [2018-11-10 09:13:32,683 INFO L226 Difference]: Without dead ends: 4583 [2018-11-10 09:13:32,687 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 09:13:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2018-11-10 09:13:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4571. [2018-11-10 09:13:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2018-11-10 09:13:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6233 transitions. [2018-11-10 09:13:32,770 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6233 transitions. Word has length 317 [2018-11-10 09:13:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:13:32,771 INFO L481 AbstractCegarLoop]: Abstraction has 4571 states and 6233 transitions. [2018-11-10 09:13:32,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:13:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6233 transitions. [2018-11-10 09:13:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-10 09:13:32,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:13:32,776 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:32,777 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:13:32,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:13:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1495728710, now seen corresponding path program 1 times [2018-11-10 09:13:32,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:13:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:13:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:13:32,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:13:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:13:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:13:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:13:32,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:13:32,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 327 with the following transitions: [2018-11-10 09:13:32,882 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [33], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [265], [268], [273], [276], [278], [281], [289], [294], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [428], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-11-10 09:13:32,928 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:13:32,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:13:33,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:14:47,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:14:47,017 INFO L272 AbstractInterpreter]: Visited 108 different actions 3060 times. Merged at 94 different actions 2605 times. Widened at 22 different actions 389 times. Found 326 fixpoints after 23 different actions. Largest state had 92 variables. [2018-11-10 09:14:47,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:14:47,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:14:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:14:47,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 09:14:47,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:14:47,030 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:14:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:14:47,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:14:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:14:47,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:14:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:14:47,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:14:47,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 09:14:47,320 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:14:47,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:14:47,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:14:47,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:14:47,321 INFO L87 Difference]: Start difference. First operand 4571 states and 6233 transitions. Second operand 4 states. [2018-11-10 09:14:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:14:47,549 INFO L93 Difference]: Finished difference Result 9237 states and 12741 transitions. [2018-11-10 09:14:47,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:14:47,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-11-10 09:14:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:14:47,557 INFO L225 Difference]: With dead ends: 9237 [2018-11-10 09:14:47,557 INFO L226 Difference]: Without dead ends: 6814 [2018-11-10 09:14:47,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 652 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 09:14:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2018-11-10 09:14:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5243. [2018-11-10 09:14:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2018-11-10 09:14:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 7251 transitions. [2018-11-10 09:14:47,659 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 7251 transitions. Word has length 326 [2018-11-10 09:14:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:14:47,659 INFO L481 AbstractCegarLoop]: Abstraction has 5243 states and 7251 transitions. [2018-11-10 09:14:47,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:14:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 7251 transitions. [2018-11-10 09:14:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-10 09:14:47,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:14:47,664 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:47,665 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:14:47,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:14:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1306856041, now seen corresponding path program 1 times [2018-11-10 09:14:47,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:14:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:14:47,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:14:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:14:47,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:14:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:14:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:14:47,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:14:47,762 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:14:47,763 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-10 09:14:47,763 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [265], [268], [273], [276], [278], [281], [289], [292], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [420], [425], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-11-10 09:14:47,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:14:47,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:14:48,082 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:16:01,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:16:01,894 INFO L272 AbstractInterpreter]: Visited 109 different actions 3090 times. Merged at 95 different actions 2634 times. Widened at 22 different actions 389 times. Found 326 fixpoints after 23 different actions. Largest state had 92 variables. [2018-11-10 09:16:01,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:16:01,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:16:01,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:16:01,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 09:16:01,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:16:01,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:16:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:16:01,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:16:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:16:02,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:16:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 09:16:02,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:16:02,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 09:16:02,074 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:16:02,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:16:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:16:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:16:02,075 INFO L87 Difference]: Start difference. First operand 5243 states and 7251 transitions. Second operand 4 states. [2018-11-10 09:16:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:16:02,345 INFO L93 Difference]: Finished difference Result 8978 states and 12412 transitions. [2018-11-10 09:16:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:16:02,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2018-11-10 09:16:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:16:02,352 INFO L225 Difference]: With dead ends: 8978 [2018-11-10 09:16:02,352 INFO L226 Difference]: Without dead ends: 3400 [2018-11-10 09:16:02,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 654 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 09:16:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2018-11-10 09:16:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2560. [2018-11-10 09:16:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-11-10 09:16:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3526 transitions. [2018-11-10 09:16:02,424 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3526 transitions. Word has length 327 [2018-11-10 09:16:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:16:02,424 INFO L481 AbstractCegarLoop]: Abstraction has 2560 states and 3526 transitions. [2018-11-10 09:16:02,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:16:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3526 transitions. [2018-11-10 09:16:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-10 09:16:02,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:16:02,429 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:02,430 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:16:02,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:16:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash -232767871, now seen corresponding path program 1 times [2018-11-10 09:16:02,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:16:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:16:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:16:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:16:02,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:16:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:16:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 09:16:02,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:16:02,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:16:02,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 355 with the following transitions: [2018-11-10 09:16:02,545 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [33], [37], [43], [45], [48], [50], [55], [60], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [135], [140], [145], [150], [153], [155], [160], [165], [170], [173], [175], [180], [183], [185], [190], [195], [200], [203], [213], [215], [218], [226], [241], [247], [252], [254], [257], [259], [265], [268], [273], [276], [278], [281], [289], [294], [296], [302], [305], [313], [315], [317], [320], [328], [333], [335], [338], [340], [345], [347], [352], [357], [359], [368], [373], [378], [380], [389], [394], [397], [405], [410], [412], [417], [428], [430], [455], [457], [523], [525], [538], [543], [547], [548], [549], [551] [2018-11-10 09:16:02,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:16:02,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:16:02,977 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:17:20,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:17:20,588 INFO L272 AbstractInterpreter]: Visited 109 different actions 3154 times. Merged at 95 different actions 2667 times. Widened at 22 different actions 390 times. Found 356 fixpoints after 23 different actions. Largest state had 92 variables. [2018-11-10 09:17:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:20,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:17:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:17:20,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/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 09:17:20,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:20,596 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:17:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:20,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:17:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 09:17:20,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:17:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 09:17:20,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:17:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 09:17:20,762 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:17:20,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:17:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:17:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:17:20,763 INFO L87 Difference]: Start difference. First operand 2560 states and 3526 transitions. Second operand 4 states. [2018-11-10 09:17:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:20,942 INFO L93 Difference]: Finished difference Result 3659 states and 4974 transitions. [2018-11-10 09:17:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:17:20,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 354 [2018-11-10 09:17:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:20,944 INFO L225 Difference]: With dead ends: 3659 [2018-11-10 09:17:20,944 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:17:20,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 708 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 09:17:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:17:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:17:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:17:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:17:20,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2018-11-10 09:17:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:20,950 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:17:20,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:17:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:17:20,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:17:20,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:17:20,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:20,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:17:21,505 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 3 [2018-11-10 09:17:21,686 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 09:17:21,686 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:17:21,686 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:17:21,686 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 09:17:21,686 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 436) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L432-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 537) the Hoare annotation is: true [2018-11-10 09:17:21,687 INFO L421 ceAbstractionStarter]: At program point L168(lines 164 549) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 09:17:21,687 INFO L421 ceAbstractionStarter]: At program point L102(lines 101 570) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (= ssl3_connect_~s__state~0 12292)) [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L401(lines 401 406) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 547) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 558) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 569) no Hoare annotation was computed. [2018-11-10 09:17:21,687 INFO L421 ceAbstractionStarter]: At program point L138(lines 134 559) the Hoare annotation is: (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 09:17:21,687 INFO L421 ceAbstractionStarter]: At program point L535(lines 98 601) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (<= ssl3_connect_~s__state~0 3) (and (= ssl3_connect_~s__state~0 4416) .cse2) (and (<= 4432 ssl3_connect_~s__state~0) .cse2 (<= ssl3_connect_~s__state~0 4528)) (and .cse2 .cse3 .cse4 .cse0 .cse1 .cse5) (<= ssl3_connect_~blastFlag~0 2) (and .cse4 (<= 4560 ssl3_connect_~s__state~0) .cse2 .cse5 (<= ssl3_connect_~s__state~0 4560) .cse3))) [2018-11-10 09:17:21,688 INFO L425 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2018-11-10 09:17:21,688 INFO L428 ceAbstractionStarter]: At program point L602(lines 97 603) the Hoare annotation is: true [2018-11-10 09:17:21,688 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 546) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 557) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 568) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L372-2(lines 372 376) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L421 ceAbstractionStarter]: At program point L207(lines 104 569) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 2) [2018-11-10 09:17:21,689 INFO L421 ceAbstractionStarter]: At program point L174(lines 170 547) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 599) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 596) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L506-1(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,689 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L308-1(lines 308 322) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 545) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 556) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 567) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 610) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 582) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L606-2(lines 606 610) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L573-2(lines 572 594) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L421 ceAbstractionStarter]: At program point L144(lines 140 557) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4448)) [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 448) no Hoare annotation was computed. [2018-11-10 09:17:21,690 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 216) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 544) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 555) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 566) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L312-2(lines 310 322) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L421 ceAbstractionStarter]: At program point L180(lines 176 545) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4528)) [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 511 515) no Hoare annotation was computed. [2018-11-10 09:17:21,691 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 416) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 253) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 543) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 554) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 565) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 65 619) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L421 ceAbstractionStarter]: At program point L150(lines 146 555) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4464) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 620) the Hoare annotation is: true [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 292) no Hoare annotation was computed. [2018-11-10 09:17:21,692 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 542) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 553) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 564) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 388) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L421 ceAbstractionStarter]: At program point L186(lines 182 543) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 09:17:21,693 INFO L421 ceAbstractionStarter]: At program point L120(lines 116 565) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 09:17:21,693 INFO L421 ceAbstractionStarter]: At program point L352(lines 65 619) the Hoare annotation is: false [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point $Ultimate##87(lines 202 536) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L428 ceAbstractionStarter]: At program point L617(lines 65 619) the Hoare annotation is: true [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 590) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-11-10 09:17:21,693 INFO L425 ceAbstractionStarter]: For program point $Ultimate##88(lines 202 536) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 541) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 552) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 563) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L453(lines 453 457) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 540) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 551) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L224-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 562) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 620) no Hoare annotation was computed. [2018-11-10 09:17:21,694 INFO L421 ceAbstractionStarter]: At program point L192(lines 188 541) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4560 ssl3_connect_~s__state~0)) (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0))) [2018-11-10 09:17:21,695 INFO L421 ceAbstractionStarter]: At program point L126(lines 122 563) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 620) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 490 502) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 428) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 231) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 539) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 550) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 561) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-11-10 09:17:21,695 INFO L421 ceAbstractionStarter]: At program point L195(lines 194 539) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (and .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-11-10 09:17:21,695 INFO L421 ceAbstractionStarter]: At program point L162(lines 152 553) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4480) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 09:17:21,695 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 498) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 460 471) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 266) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 399) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L329-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 538) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 549) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 560) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 601) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L98-2(lines 65 619) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 468) no Hoare annotation was computed. [2018-11-10 09:17:21,696 INFO L428 ceAbstractionStarter]: At program point L198(lines 197 538) the Hoare annotation is: true [2018-11-10 09:17:21,697 INFO L421 ceAbstractionStarter]: At program point L132(lines 128 561) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 548) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 559) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 570) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 621 631) the Hoare annotation is: true [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 621 631) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 621 631) no Hoare annotation was computed. [2018-11-10 09:17:21,697 INFO L428 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: true [2018-11-10 09:17:21,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:17:21 BoogieIcfgContainer [2018-11-10 09:17:21,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:17:21,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:17:21,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:17:21,712 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:17:21,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:13:28" (3/4) ... [2018-11-10 09:17:21,715 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:17:21,720 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:17:21,721 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 09:17:21,721 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:17:21,727 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 09:17:21,727 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 09:17:21,728 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 09:17:21,797 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d7e79dd6-3d9f-4502-a36d-1b2cc594ea66/bin-2019/utaipan/witness.graphml [2018-11-10 09:17:21,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:17:21,798 INFO L168 Benchmark]: Toolchain (without parser) took 233918.53 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 960.3 MB in the beginning and 1.9 GB in the end (delta: -909.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,798 INFO L168 Benchmark]: CDTParser took 0.16 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 09:17:21,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 943.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.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 09:17:21,799 INFO L168 Benchmark]: Boogie Preprocessor took 73.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,800 INFO L168 Benchmark]: RCFGBuilder took 487.70 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,800 INFO L168 Benchmark]: TraceAbstraction took 232992.74 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -778.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,800 INFO L168 Benchmark]: Witness Printer took 85.91 ms. Allocated memory is still 4.9 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 2.3 kB). Peak memory consumption was 2.3 kB. Max. memory is 11.5 GB. [2018-11-10 09:17:21,801 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.16 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 260.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 943.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.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 73.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.70 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 232992.74 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -778.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 85.91 ms. Allocated memory is still 4.9 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 2.3 kB). Peak memory consumption was 2.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: 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: 98]: Loop Invariant Derived loop invariant: ((((((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) || s__state <= 3) || (s__state == 4416 && blastFlag <= 4)) || ((4432 <= s__state && blastFlag <= 4) && s__state <= 4528)) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || blastFlag <= 2) || (((((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: 146]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag <= 4) && s__state <= 4432 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4560 <= s__state) || (4432 <= s__state && s__hit == 0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) || (((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4)) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4448 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4560) && blastFlag <= 4 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4528 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 137 locations, 1 error locations. SAFE Result, 232.9s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4057 SDtfs, 1672 SDslu, 2345 SDs, 0 SdLazy, 2084 SolverSat, 534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2083 GetRequests, 2050 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 226.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 3570 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 148 NumberOfFragments, 264 HoareAnnotationTreeSize, 27 FomulaSimplifications, 32227 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 24926 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 5105 NumberOfCodeBlocks, 5105 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6085 ConstructedInterpolants, 0 QuantifiedInterpolants, 2076897 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1918 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 18915/19011 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...