./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-635dfa2 [2018-12-02 20:18:22,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:18:22,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:18:22,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:18:22,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:18:22,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:18:22,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:18:22,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:18:22,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:18:22,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:18:22,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:18:22,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:18:22,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:18:22,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:18:22,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:18:22,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:18:22,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:18:22,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:18:22,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:18:22,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:18:22,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:18:22,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:18:22,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:18:22,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:18:22,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:18:22,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:18:22,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:18:22,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:18:22,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:18:22,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:18:22,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:18:22,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:18:22,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:18:22,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:18:22,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:18:22,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:18:22,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:18:22,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:18:22,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:18:22,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:18:22,641 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:18:22,641 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:18:22,642 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:18:22,642 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:18:22,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:18:22,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:18:22,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:18:22,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:18:22,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:18:22,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:18:22,646 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_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-12-02 20:18:22,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:18:22,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:18:22,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:18:22,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:18:22,679 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:18:22,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 20:18:22,714 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/data/9a694cddd/d333102c1bfd4011b62a95f102b517e7/FLAG48ec6b7e4 [2018-12-02 20:18:23,117 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:18:23,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 20:18:23,123 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/data/9a694cddd/d333102c1bfd4011b62a95f102b517e7/FLAG48ec6b7e4 [2018-12-02 20:18:23,131 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/data/9a694cddd/d333102c1bfd4011b62a95f102b517e7 [2018-12-02 20:18:23,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:18:23,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:18:23,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:18:23,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:18:23,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:18:23,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e47b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23, skipping insertion in model container [2018-12-02 20:18:23,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:18:23,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:18:23,274 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:18:23,276 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:18:23,306 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:18:23,344 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:18:23,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23 WrapperNode [2018-12-02 20:18:23,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:18:23,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:18:23,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:18:23,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:18:23,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:18:23,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:18:23,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:18:23,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:18:23,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... [2018-12-02 20:18:23,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:18:23,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:18:23,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:18:23,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:18:23,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-12-02 20:18:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:18:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:18:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-02 20:18:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-02 20:18:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:18:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:18:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:18:23,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:18:23,488 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 20:18:23,488 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 20:18:23,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:18:23,701 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 20:18:23,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:23 BoogieIcfgContainer [2018-12-02 20:18:23,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:18:23,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:18:23,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:18:23,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:18:23,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:18:23" (1/3) ... [2018-12-02 20:18:23,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505fc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:23, skipping insertion in model container [2018-12-02 20:18:23,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:18:23" (2/3) ... [2018-12-02 20:18:23,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505fc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:18:23, skipping insertion in model container [2018-12-02 20:18:23,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:23" (3/3) ... [2018-12-02 20:18:23,706 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 20:18:23,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:18:23,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:18:23,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:18:23,747 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:18:23,747 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:18:23,747 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:18:23,747 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:18:23,747 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:18:23,748 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:18:23,748 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:18:23,748 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:18:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-12-02 20:18:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:18:23,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:23,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:18:23,765 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:23,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1233902378, now seen corresponding path program 1 times [2018-12-02 20:18:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:23,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:23,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:18:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:23,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:23,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:23,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:23,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:23,900 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2018-12-02 20:18:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:23,990 INFO L93 Difference]: Finished difference Result 258 states and 434 transitions. [2018-12-02 20:18:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:23,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 20:18:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:23,998 INFO L225 Difference]: With dead ends: 258 [2018-12-02 20:18:23,998 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 20:18:24,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 20:18:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-02 20:18:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-02 20:18:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2018-12-02 20:18:24,026 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 30 [2018-12-02 20:18:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,027 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2018-12-02 20:18:24,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2018-12-02 20:18:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 20:18:24,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,028 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1082493398, now seen corresponding path program 1 times [2018-12-02 20:18:24,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:18:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,067 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand 3 states. [2018-12-02 20:18:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,152 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2018-12-02 20:18:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-02 20:18:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,154 INFO L225 Difference]: With dead ends: 238 [2018-12-02 20:18:24,154 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 20:18:24,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 20:18:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-12-02 20:18:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 20:18:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2018-12-02 20:18:24,163 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 42 [2018-12-02 20:18:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,163 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2018-12-02 20:18:24,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2018-12-02 20:18:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 20:18:24,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,165 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash -636452013, now seen corresponding path program 1 times [2018-12-02 20:18:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 20:18:24,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,215 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand 3 states. [2018-12-02 20:18:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,308 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2018-12-02 20:18:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-02 20:18:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,309 INFO L225 Difference]: With dead ends: 271 [2018-12-02 20:18:24,310 INFO L226 Difference]: Without dead ends: 154 [2018-12-02 20:18:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-02 20:18:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-02 20:18:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-02 20:18:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2018-12-02 20:18:24,319 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 56 [2018-12-02 20:18:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,319 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2018-12-02 20:18:24,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2018-12-02 20:18:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 20:18:24,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,320 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:18:24,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,321 INFO L82 PathProgramCache]: Analyzing trace with hash 327884321, now seen corresponding path program 1 times [2018-12-02 20:18:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 20:18:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,379 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand 3 states. [2018-12-02 20:18:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,418 INFO L93 Difference]: Finished difference Result 416 states and 611 transitions. [2018-12-02 20:18:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-02 20:18:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,421 INFO L225 Difference]: With dead ends: 416 [2018-12-02 20:18:24,421 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 20:18:24,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 20:18:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-12-02 20:18:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-02 20:18:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 411 transitions. [2018-12-02 20:18:24,433 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 411 transitions. Word has length 73 [2018-12-02 20:18:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,433 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 411 transitions. [2018-12-02 20:18:24,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 411 transitions. [2018-12-02 20:18:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 20:18:24,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,435 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,435 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1769484127, now seen corresponding path program 1 times [2018-12-02 20:18:24,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 20:18:24,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,483 INFO L87 Difference]: Start difference. First operand 282 states and 411 transitions. Second operand 3 states. [2018-12-02 20:18:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,591 INFO L93 Difference]: Finished difference Result 596 states and 884 transitions. [2018-12-02 20:18:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 20:18:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,592 INFO L225 Difference]: With dead ends: 596 [2018-12-02 20:18:24,592 INFO L226 Difference]: Without dead ends: 330 [2018-12-02 20:18:24,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-02 20:18:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 324. [2018-12-02 20:18:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-02 20:18:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 463 transitions. [2018-12-02 20:18:24,600 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 463 transitions. Word has length 91 [2018-12-02 20:18:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,601 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 463 transitions. [2018-12-02 20:18:24,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 463 transitions. [2018-12-02 20:18:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 20:18:24,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,602 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 91325785, now seen corresponding path program 1 times [2018-12-02 20:18:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-02 20:18:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,637 INFO L87 Difference]: Start difference. First operand 324 states and 463 transitions. Second operand 3 states. [2018-12-02 20:18:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,665 INFO L93 Difference]: Finished difference Result 479 states and 686 transitions. [2018-12-02 20:18:24,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-02 20:18:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,673 INFO L225 Difference]: With dead ends: 479 [2018-12-02 20:18:24,673 INFO L226 Difference]: Without dead ends: 477 [2018-12-02 20:18:24,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-02 20:18:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-12-02 20:18:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-02 20:18:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 684 transitions. [2018-12-02 20:18:24,687 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 684 transitions. Word has length 111 [2018-12-02 20:18:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,688 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 684 transitions. [2018-12-02 20:18:24,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 684 transitions. [2018-12-02 20:18:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 20:18:24,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,690 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1758997330, now seen corresponding path program 1 times [2018-12-02 20:18:24,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-02 20:18:24,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,731 INFO L87 Difference]: Start difference. First operand 477 states and 684 transitions. Second operand 3 states. [2018-12-02 20:18:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,849 INFO L93 Difference]: Finished difference Result 1088 states and 1611 transitions. [2018-12-02 20:18:24,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-12-02 20:18:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,851 INFO L225 Difference]: With dead ends: 1088 [2018-12-02 20:18:24,851 INFO L226 Difference]: Without dead ends: 624 [2018-12-02 20:18:24,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-02 20:18:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 600. [2018-12-02 20:18:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-02 20:18:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 882 transitions. [2018-12-02 20:18:24,860 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 882 transitions. Word has length 129 [2018-12-02 20:18:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:24,861 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 882 transitions. [2018-12-02 20:18:24,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 882 transitions. [2018-12-02 20:18:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 20:18:24,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:24,862 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:24,862 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:24,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash 953297081, now seen corresponding path program 1 times [2018-12-02 20:18:24,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:24,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:24,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:24,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-02 20:18:24,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:24,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:24,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:24,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:24,895 INFO L87 Difference]: Start difference. First operand 600 states and 882 transitions. Second operand 3 states. [2018-12-02 20:18:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:24,995 INFO L93 Difference]: Finished difference Result 1462 states and 2210 transitions. [2018-12-02 20:18:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:24,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-12-02 20:18:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:24,999 INFO L225 Difference]: With dead ends: 1462 [2018-12-02 20:18:24,999 INFO L226 Difference]: Without dead ends: 827 [2018-12-02 20:18:25,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-12-02 20:18:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 789. [2018-12-02 20:18:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-02 20:18:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1134 transitions. [2018-12-02 20:18:25,020 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1134 transitions. Word has length 155 [2018-12-02 20:18:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,020 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1134 transitions. [2018-12-02 20:18:25,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1134 transitions. [2018-12-02 20:18:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 20:18:25,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,023 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,023 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash -260724200, now seen corresponding path program 1 times [2018-12-02 20:18:25,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-02 20:18:25,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:25,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:25,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:25,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,063 INFO L87 Difference]: Start difference. First operand 789 states and 1134 transitions. Second operand 3 states. [2018-12-02 20:18:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:25,186 INFO L93 Difference]: Finished difference Result 1718 states and 2487 transitions. [2018-12-02 20:18:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:25,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-12-02 20:18:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:25,189 INFO L225 Difference]: With dead ends: 1718 [2018-12-02 20:18:25,190 INFO L226 Difference]: Without dead ends: 900 [2018-12-02 20:18:25,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-12-02 20:18:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 864. [2018-12-02 20:18:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-12-02 20:18:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1230 transitions. [2018-12-02 20:18:25,209 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1230 transitions. Word has length 176 [2018-12-02 20:18:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,210 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1230 transitions. [2018-12-02 20:18:25,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1230 transitions. [2018-12-02 20:18:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 20:18:25,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,212 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,213 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1797193209, now seen corresponding path program 1 times [2018-12-02 20:18:25,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-02 20:18:25,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:25,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:25,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:25,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,264 INFO L87 Difference]: Start difference. First operand 864 states and 1230 transitions. Second operand 3 states. [2018-12-02 20:18:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:25,368 INFO L93 Difference]: Finished difference Result 1868 states and 2679 transitions. [2018-12-02 20:18:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:25,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-12-02 20:18:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:25,371 INFO L225 Difference]: With dead ends: 1868 [2018-12-02 20:18:25,372 INFO L226 Difference]: Without dead ends: 993 [2018-12-02 20:18:25,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-12-02 20:18:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 957. [2018-12-02 20:18:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-12-02 20:18:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1362 transitions. [2018-12-02 20:18:25,396 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1362 transitions. Word has length 200 [2018-12-02 20:18:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,397 INFO L480 AbstractCegarLoop]: Abstraction has 957 states and 1362 transitions. [2018-12-02 20:18:25,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1362 transitions. [2018-12-02 20:18:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-02 20:18:25,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,399 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash -737705851, now seen corresponding path program 1 times [2018-12-02 20:18:25,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-02 20:18:25,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:25,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:25,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:25,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,436 INFO L87 Difference]: Start difference. First operand 957 states and 1362 transitions. Second operand 3 states. [2018-12-02 20:18:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:25,460 INFO L93 Difference]: Finished difference Result 2839 states and 4044 transitions. [2018-12-02 20:18:25,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:25,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-12-02 20:18:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:25,464 INFO L225 Difference]: With dead ends: 2839 [2018-12-02 20:18:25,464 INFO L226 Difference]: Without dead ends: 1898 [2018-12-02 20:18:25,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-02 20:18:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-12-02 20:18:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-12-02 20:18:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2699 transitions. [2018-12-02 20:18:25,492 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2699 transitions. Word has length 230 [2018-12-02 20:18:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,492 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2699 transitions. [2018-12-02 20:18:25,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2699 transitions. [2018-12-02 20:18:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-02 20:18:25,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,495 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,495 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1953859577, now seen corresponding path program 1 times [2018-12-02 20:18:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-12-02 20:18:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:25,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:25,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,535 INFO L87 Difference]: Start difference. First operand 1896 states and 2699 transitions. Second operand 3 states. [2018-12-02 20:18:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:25,663 INFO L93 Difference]: Finished difference Result 4082 states and 5845 transitions. [2018-12-02 20:18:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:25,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-12-02 20:18:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:25,670 INFO L225 Difference]: With dead ends: 4082 [2018-12-02 20:18:25,670 INFO L226 Difference]: Without dead ends: 2172 [2018-12-02 20:18:25,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2018-12-02 20:18:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2106. [2018-12-02 20:18:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2018-12-02 20:18:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3011 transitions. [2018-12-02 20:18:25,718 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3011 transitions. Word has length 230 [2018-12-02 20:18:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,718 INFO L480 AbstractCegarLoop]: Abstraction has 2106 states and 3011 transitions. [2018-12-02 20:18:25,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3011 transitions. [2018-12-02 20:18:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 20:18:25,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,723 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,723 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1547041617, now seen corresponding path program 1 times [2018-12-02 20:18:25,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-12-02 20:18:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:25,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:25,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,775 INFO L87 Difference]: Start difference. First operand 2106 states and 3011 transitions. Second operand 3 states. [2018-12-02 20:18:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:25,895 INFO L93 Difference]: Finished difference Result 4262 states and 6079 transitions. [2018-12-02 20:18:25,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:25,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-12-02 20:18:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:25,902 INFO L225 Difference]: With dead ends: 4262 [2018-12-02 20:18:25,902 INFO L226 Difference]: Without dead ends: 2154 [2018-12-02 20:18:25,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-12-02 20:18:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2088. [2018-12-02 20:18:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-12-02 20:18:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2957 transitions. [2018-12-02 20:18:25,946 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2957 transitions. Word has length 265 [2018-12-02 20:18:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:25,946 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 2957 transitions. [2018-12-02 20:18:25,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2957 transitions. [2018-12-02 20:18:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-02 20:18:25,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:25,950 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:25,950 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:25,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 873507993, now seen corresponding path program 1 times [2018-12-02 20:18:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:25,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-12-02 20:18:26,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:26,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:26,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:26,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:26,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,015 INFO L87 Difference]: Start difference. First operand 2088 states and 2957 transitions. Second operand 3 states. [2018-12-02 20:18:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:26,059 INFO L93 Difference]: Finished difference Result 6217 states and 8808 transitions. [2018-12-02 20:18:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:26,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-12-02 20:18:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:26,066 INFO L225 Difference]: With dead ends: 6217 [2018-12-02 20:18:26,066 INFO L226 Difference]: Without dead ends: 4145 [2018-12-02 20:18:26,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2018-12-02 20:18:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 4143. [2018-12-02 20:18:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2018-12-02 20:18:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5853 transitions. [2018-12-02 20:18:26,128 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5853 transitions. Word has length 275 [2018-12-02 20:18:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:26,128 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 5853 transitions. [2018-12-02 20:18:26,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5853 transitions. [2018-12-02 20:18:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-02 20:18:26,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:26,132 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 20:18:26,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:26,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash 776049309, now seen corresponding path program 1 times [2018-12-02 20:18:26,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:26,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:26,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,176 INFO L87 Difference]: Start difference. First operand 4143 states and 5853 transitions. Second operand 3 states. [2018-12-02 20:18:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:26,287 INFO L93 Difference]: Finished difference Result 8375 states and 11814 transitions. [2018-12-02 20:18:26,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:26,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-12-02 20:18:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:26,294 INFO L225 Difference]: With dead ends: 8375 [2018-12-02 20:18:26,294 INFO L226 Difference]: Without dead ends: 4251 [2018-12-02 20:18:26,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2018-12-02 20:18:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4143. [2018-12-02 20:18:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2018-12-02 20:18:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5745 transitions. [2018-12-02 20:18:26,343 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5745 transitions. Word has length 275 [2018-12-02 20:18:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:26,343 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 5745 transitions. [2018-12-02 20:18:26,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5745 transitions. [2018-12-02 20:18:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-02 20:18:26,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:26,346 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 20:18:26,346 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:26,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:26,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1838373004, now seen corresponding path program 1 times [2018-12-02 20:18:26,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-02 20:18:26,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:26,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:26,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:26,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:26,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,391 INFO L87 Difference]: Start difference. First operand 4143 states and 5745 transitions. Second operand 3 states. [2018-12-02 20:18:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:26,526 INFO L93 Difference]: Finished difference Result 8861 states and 12168 transitions. [2018-12-02 20:18:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:26,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-12-02 20:18:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:26,533 INFO L225 Difference]: With dead ends: 8861 [2018-12-02 20:18:26,533 INFO L226 Difference]: Without dead ends: 4737 [2018-12-02 20:18:26,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2018-12-02 20:18:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4317. [2018-12-02 20:18:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2018-12-02 20:18:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5979 transitions. [2018-12-02 20:18:26,613 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5979 transitions. Word has length 302 [2018-12-02 20:18:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 4317 states and 5979 transitions. [2018-12-02 20:18:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5979 transitions. [2018-12-02 20:18:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-02 20:18:26,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:26,616 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:26,616 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1702310885, now seen corresponding path program 1 times [2018-12-02 20:18:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-02 20:18:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:18:26,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:18:26,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,663 INFO L87 Difference]: Start difference. First operand 4317 states and 5979 transitions. Second operand 3 states. [2018-12-02 20:18:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:26,780 INFO L93 Difference]: Finished difference Result 8939 states and 12258 transitions. [2018-12-02 20:18:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:26,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-12-02 20:18:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:26,790 INFO L225 Difference]: With dead ends: 8939 [2018-12-02 20:18:26,790 INFO L226 Difference]: Without dead ends: 4137 [2018-12-02 20:18:26,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:18:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2018-12-02 20:18:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4119. [2018-12-02 20:18:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2018-12-02 20:18:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 5685 transitions. [2018-12-02 20:18:26,837 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 5685 transitions. Word has length 303 [2018-12-02 20:18:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:26,838 INFO L480 AbstractCegarLoop]: Abstraction has 4119 states and 5685 transitions. [2018-12-02 20:18:26,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 5685 transitions. [2018-12-02 20:18:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-02 20:18:26,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:26,841 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 20:18:26,842 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 485612073, now seen corresponding path program 1 times [2018-12-02 20:18:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:26,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:26,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:26,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:26,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:26,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:18:26,907 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-12-02 20:18:26,908 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [288], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2018-12-02 20:18:26,932 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:18:26,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:18:27,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:18:27,483 INFO L272 AbstractInterpreter]: Visited 108 different actions 502 times. Merged at 89 different actions 340 times. Widened at 7 different actions 7 times. Performed 2755 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2755 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 52 fixpoints after 21 different actions. Largest state had 92 variables. [2018-12-02 20:18:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:27,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:18:27,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:27,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-12-02 20:18:27,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:27,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:18:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:27,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:18:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2018-12-02 20:18:27,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:18:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2018-12-02 20:18:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:18:27,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 20:18:27,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:18:27,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:18:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:18:27,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:18:27,710 INFO L87 Difference]: Start difference. First operand 4119 states and 5685 transitions. Second operand 3 states. [2018-12-02 20:18:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:27,773 INFO L93 Difference]: Finished difference Result 6205 states and 8544 transitions. [2018-12-02 20:18:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:18:27,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-12-02 20:18:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:27,781 INFO L225 Difference]: With dead ends: 6205 [2018-12-02 20:18:27,782 INFO L226 Difference]: Without dead ends: 4121 [2018-12-02 20:18:27,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:18:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2018-12-02 20:18:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4107. [2018-12-02 20:18:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4107 states. [2018-12-02 20:18:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 5649 transitions. [2018-12-02 20:18:27,865 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 5649 transitions. Word has length 313 [2018-12-02 20:18:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:27,866 INFO L480 AbstractCegarLoop]: Abstraction has 4107 states and 5649 transitions. [2018-12-02 20:18:27,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:18:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5649 transitions. [2018-12-02 20:18:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-02 20:18:27,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:27,869 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:27,869 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:27,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1319826261, now seen corresponding path program 1 times [2018-12-02 20:18:27,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:27,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:27,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:27,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:27,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:18:27,939 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-12-02 20:18:27,939 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2018-12-02 20:18:27,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:18:27,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:18:28,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:18:28,266 INFO L272 AbstractInterpreter]: Visited 107 different actions 503 times. Merged at 90 different actions 348 times. Widened at 4 different actions 4 times. Performed 2738 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2738 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 58 fixpoints after 20 different actions. Largest state had 92 variables. [2018-12-02 20:18:28,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:28,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:18:28,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:28,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-12-02 20:18:28,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:28,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:18:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:28,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:18:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:28,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:18:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:28,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:18:28,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 20:18:28,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:18:28,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:18:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:18:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:18:28,445 INFO L87 Difference]: Start difference. First operand 4107 states and 5649 transitions. Second operand 4 states. [2018-12-02 20:18:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:28,658 INFO L93 Difference]: Finished difference Result 7284 states and 10124 transitions. [2018-12-02 20:18:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:18:28,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2018-12-02 20:18:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:28,668 INFO L225 Difference]: With dead ends: 7284 [2018-12-02 20:18:28,668 INFO L226 Difference]: Without dead ends: 5092 [2018-12-02 20:18:28,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 626 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-12-02 20:18:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2018-12-02 20:18:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4280. [2018-12-02 20:18:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2018-12-02 20:18:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5914 transitions. [2018-12-02 20:18:28,761 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5914 transitions. Word has length 313 [2018-12-02 20:18:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:28,761 INFO L480 AbstractCegarLoop]: Abstraction has 4280 states and 5914 transitions. [2018-12-02 20:18:28,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:18:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5914 transitions. [2018-12-02 20:18:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-02 20:18:28,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:28,767 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:28,767 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:28,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2043908506, now seen corresponding path program 1 times [2018-12-02 20:18:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:28,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:28,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:28,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:18:28,829 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-12-02 20:18:28,829 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [261], [264], [269], [272], [274], [277], [285], [288], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2018-12-02 20:18:28,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:18:28,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:18:29,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:18:29,190 INFO L272 AbstractInterpreter]: Visited 108 different actions 606 times. Merged at 90 different actions 439 times. Widened at 15 different actions 15 times. Performed 3156 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3156 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 69 fixpoints after 20 different actions. Largest state had 92 variables. [2018-12-02 20:18:29,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:29,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:18:29,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:29,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/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-12-02 20:18:29,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:29,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:18:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:29,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:18:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:29,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:18:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 20:18:29,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:18:29,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 20:18:29,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:18:29,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:18:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:18:29,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:18:29,403 INFO L87 Difference]: Start difference. First operand 4280 states and 5914 transitions. Second operand 4 states. [2018-12-02 20:18:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:29,560 INFO L93 Difference]: Finished difference Result 5435 states and 7545 transitions. [2018-12-02 20:18:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:18:29,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-12-02 20:18:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:29,564 INFO L225 Difference]: With dead ends: 5435 [2018-12-02 20:18:29,564 INFO L226 Difference]: Without dead ends: 2213 [2018-12-02 20:18:29,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 628 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-12-02 20:18:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2018-12-02 20:18:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2213. [2018-12-02 20:18:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2018-12-02 20:18:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3071 transitions. [2018-12-02 20:18:29,612 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3071 transitions. Word has length 314 [2018-12-02 20:18:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:29,612 INFO L480 AbstractCegarLoop]: Abstraction has 2213 states and 3071 transitions. [2018-12-02 20:18:29,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:18:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3071 transitions. [2018-12-02 20:18:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-02 20:18:29,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:18:29,616 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:18:29,616 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:18:29,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1619434322, now seen corresponding path program 1 times [2018-12-02 20:18:29,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:18:29,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:29,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:29,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:18:29,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:18:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-02 20:18:29,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:29,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:18:29,715 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-12-02 20:18:29,715 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [30], [39], [41], [44], [46], [51], [56], [61], [66], [69], [71], [76], [79], [81], [86], [89], [91], [96], [99], [101], [106], [109], [111], [116], [119], [121], [126], [131], [136], [141], [146], [149], [151], [156], [161], [166], [169], [171], [176], [179], [181], [186], [191], [196], [199], [209], [211], [214], [222], [237], [243], [248], [250], [253], [255], [261], [264], [269], [272], [274], [277], [285], [290], [292], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [451], [453], [519], [521], [534], [542], [546], [547], [548], [550] [2018-12-02 20:18:29,717 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:18:29,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:18:29,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:18:29,893 INFO L272 AbstractInterpreter]: Visited 108 different actions 329 times. Merged at 89 different actions 189 times. Widened at 1 different actions 1 times. Performed 1642 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1642 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 32 fixpoints after 18 different actions. Largest state had 92 variables. [2018-12-02 20:18:29,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:18:29,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:18:29,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:18:29,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:18:29,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:18:29,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:18:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:18:29,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:18:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-02 20:18:29,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:18:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-12-02 20:18:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:18:30,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 20:18:30,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:18:30,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:18:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:18:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:18:30,082 INFO L87 Difference]: Start difference. First operand 2213 states and 3071 transitions. Second operand 4 states. [2018-12-02 20:18:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:18:30,250 INFO L93 Difference]: Finished difference Result 3159 states and 4328 transitions. [2018-12-02 20:18:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:18:30,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2018-12-02 20:18:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:18:30,250 INFO L225 Difference]: With dead ends: 3159 [2018-12-02 20:18:30,251 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:18:30,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 678 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-12-02 20:18:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:18:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:18:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:18:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:18:30,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2018-12-02 20:18:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:18:30,254 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:18:30,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:18:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:18:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:18:30,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 20:18:30,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:18:30,734 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 436) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L432-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 537) the Hoare annotation is: true [2018-12-02 20:18:30,734 INFO L444 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-12-02 20:18:30,734 INFO L444 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-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L401(lines 401 406) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-12-02 20:18:30,734 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 547) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 558) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 569) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L444 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-12-02 20:18:30,735 INFO L444 ceAbstractionStarter]: At program point L535(lines 98 601) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse4 (= ssl3_connect_~s__hit~0 0))) (or (<= ssl3_connect_~s__state~0 3) (and (<= 4432 ssl3_connect_~s__state~0) .cse0 (<= ssl3_connect_~s__state~0 4528)) (<= ssl3_connect_~blastFlag~0 2) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5) (and (= ssl3_connect_~s__state~0 4416) .cse0) (and .cse1 (<= 4560 ssl3_connect_~s__state~0) .cse0 .cse4 (<= ssl3_connect_~s__state~0 4560) .cse5) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3 .cse0 (not .cse4)))) [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L451 ceAbstractionStarter]: At program point L602(lines 97 603) the Hoare annotation is: true [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 546) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 557) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 568) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L448 ceAbstractionStarter]: For program point L372-2(lines 372 376) no Hoare annotation was computed. [2018-12-02 20:18:30,735 INFO L444 ceAbstractionStarter]: At program point L207(lines 104 569) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 2) [2018-12-02 20:18:30,736 INFO L444 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-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 599) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 596) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L506-1(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L308-1(lines 308 322) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 545) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 556) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 567) no Hoare annotation was computed. [2018-12-02 20:18:30,736 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 610) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 582) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L606-2(lines 606 610) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L573-2(lines 572 594) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L444 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-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 448) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 216) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 544) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 555) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 566) no Hoare annotation was computed. [2018-12-02 20:18:30,737 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L312-2(lines 310 322) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L444 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-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 511 515) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 416) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 253) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 543) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 554) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 565) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 65 619) no Hoare annotation was computed. [2018-12-02 20:18:30,738 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 555) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4480) (<= ssl3_connect_~blastFlag~0 4)) [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 620) the Hoare annotation is: true [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 292) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 542) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 553) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 564) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 388) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2018-12-02 20:18:30,739 INFO L444 ceAbstractionStarter]: At program point L186(lines 182 543) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 (<= ssl3_connect_~s__state~0 4560) .cse1) (and .cse0 .cse1 (not (= ssl3_connect_~s__hit~0 0))))) [2018-12-02 20:18:30,739 INFO L444 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-12-02 20:18:30,739 INFO L444 ceAbstractionStarter]: At program point L352(lines 65 619) the Hoare annotation is: false [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point $Ultimate##87(lines 202 536) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L451 ceAbstractionStarter]: At program point L617(lines 65 619) the Hoare annotation is: true [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 590) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point $Ultimate##88(lines 202 536) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 541) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 552) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 563) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L453(lines 453 457) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-12-02 20:18:30,740 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 540) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 551) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L224-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 562) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 620) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L444 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-12-02 20:18:30,741 INFO L444 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-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 620) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 490 502) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 428) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 231) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 539) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 550) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 561) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L444 ceAbstractionStarter]: At program point L195(lines 194 539) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2 (not .cse3)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-12-02 20:18:30,741 INFO L444 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-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 498) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 460 471) no Hoare annotation was computed. [2018-12-02 20:18:30,741 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 266) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 399) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L329-2(lines 202 534) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 538) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 549) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 560) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 65 619) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 468) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L451 ceAbstractionStarter]: At program point L198(lines 197 538) the Hoare annotation is: true [2018-12-02 20:18:30,742 INFO L444 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-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 548) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 559) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 570) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 20:18:30,742 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L448 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2018-12-02 20:18:30,742 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 621 631) the Hoare annotation is: true [2018-12-02 20:18:30,743 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 621 631) no Hoare annotation was computed. [2018-12-02 20:18:30,743 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 621 631) no Hoare annotation was computed. [2018-12-02 20:18:30,743 INFO L451 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: true [2018-12-02 20:18:30,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:18:30 BoogieIcfgContainer [2018-12-02 20:18:30,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:18:30,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:18:30,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:18:30,757 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:18:30,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:18:23" (3/4) ... [2018-12-02 20:18:30,761 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:18:30,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:18:30,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-02 20:18:30,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:18:30,774 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 20:18:30,774 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 20:18:30,775 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 20:18:30,847 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bfb32c51-caa5-4649-bb20-f642bc328a8e/bin-2019/utaipan/witness.graphml [2018-12-02 20:18:30,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:18:30,848 INFO L168 Benchmark]: Toolchain (without parser) took 7713.90 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 818.4 MB). Free memory was 950.8 MB in the beginning and 1.4 GB in the end (delta: -478.4 MB). Peak memory consumption was 340.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,849 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:18:30,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,850 INFO L168 Benchmark]: Boogie Preprocessor took 22.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,850 INFO L168 Benchmark]: RCFGBuilder took 318.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,850 INFO L168 Benchmark]: TraceAbstraction took 7055.20 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 707.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -386.7 MB). Peak memory consumption was 320.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,851 INFO L168 Benchmark]: Witness Printer took 89.80 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:18:30,852 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 210.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 318.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7055.20 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 707.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -386.7 MB). Peak memory consumption was 320.6 MB. Max. memory is 11.5 GB. * Witness Printer took 89.80 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. 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__state <= 3 || ((4432 <= s__state && blastFlag <= 4) && s__state <= 4528)) || blastFlag <= 2) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (s__state == 4416 && blastFlag <= 4)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && !(s__hit == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4480) && 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: ((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || ((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) - 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) || ((4432 <= s__state && blastFlag <= 4) && !(s__hit == 0)) - 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, 136 locations, 1 error locations. SAFE Result, 7.0s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 4162 SDtfs, 1585 SDslu, 2415 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2627 GetRequests, 2592 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4317occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 193 NumberOfFragments, 284 HoareAnnotationTreeSize, 27 FomulaSimplifications, 19269 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 27 FomulaSimplificationsInter, 3749 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 5501 NumberOfCodeBlocks, 5501 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 6751 ConstructedInterpolants, 0 QuantifiedInterpolants, 2777883 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2483 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 29 InterpolantComputations, 19 PerfectInterpolantSequences, 20845/20944 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...