./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.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_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 6dc0763a398b0a639e17ba351b312330c5e02cd6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:29:45,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:29:45,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:29:45,691 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:29:45,691 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:29:45,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:29:45,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:29:45,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:29:45,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:29:45,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:29:45,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:29:45,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:29:45,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:29:45,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:29:45,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:29:45,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:29:45,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:29:45,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:29:45,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:29:45,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:29:45,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:29:45,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:29:45,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:29:45,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:29:45,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:29:45,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:29:45,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:29:45,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:29:45,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:29:45,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:29:45,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:29:45,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:29:45,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:29:45,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:29:45,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:29:45,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:29:45,705 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 06:29:45,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:29:45,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:29:45,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:29:45,713 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:29:45,713 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:29:45,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:29:45,713 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:29:45,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:29:45,713 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:29:45,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:29:45,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:29:45,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:29:45,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:29:45,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:29:45,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 06:29:45,716 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_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 -> 6dc0763a398b0a639e17ba351b312330c5e02cd6 [2018-12-02 06:29:45,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:29:45,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:29:45,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:29:45,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:29:45,746 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:29:45,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-12-02 06:29:45,785 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/data/e9b9cca1a/e2f90ed57cc840888a7557fed99d3287/FLAGf8eddd593 [2018-12-02 06:29:46,170 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:29:46,171 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-12-02 06:29:46,176 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/data/e9b9cca1a/e2f90ed57cc840888a7557fed99d3287/FLAGf8eddd593 [2018-12-02 06:29:46,184 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/data/e9b9cca1a/e2f90ed57cc840888a7557fed99d3287 [2018-12-02 06:29:46,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:29:46,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:29:46,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:29:46,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:29:46,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:29:46,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,193 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 06:29:46, skipping insertion in model container [2018-12-02 06:29:46,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:29:46,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:29:46,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:29:46,354 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:29:46,391 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:29:46,434 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:29:46,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46 WrapperNode [2018-12-02 06:29:46,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:29:46,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:29:46,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:29:46,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:29:46,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:29:46,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:29:46,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:29:46,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:29:46,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... [2018-12-02 06:29:46,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:29:46,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:29:46,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:29:46,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:29:46,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 06:29:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:29:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:29:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:29:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:29:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:29:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:29:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 06:29:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 06:29:46,605 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 06:29:46,606 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 06:29:46,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:29:46,864 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 06:29:46,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:46 BoogieIcfgContainer [2018-12-02 06:29:46,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:29:46,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:29:46,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:29:46,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:29:46,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:29:46" (1/3) ... [2018-12-02 06:29:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8bde88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:29:46, skipping insertion in model container [2018-12-02 06:29:46,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:46" (2/3) ... [2018-12-02 06:29:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8bde88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:29:46, skipping insertion in model container [2018-12-02 06:29:46,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:46" (3/3) ... [2018-12-02 06:29:46,868 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-12-02 06:29:46,873 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:29:46,878 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 06:29:46,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 06:29:46,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:29:46,905 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:29:46,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:29:46,905 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:29:46,905 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:29:46,905 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:29:46,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:29:46,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:29:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-12-02 06:29:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:29:46,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:46,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:46,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:46,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2018-12-02 06:29:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:46,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:47,076 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 06:29:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:47,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:47,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:47,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:47,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:47,090 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2018-12-02 06:29:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:47,284 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2018-12-02 06:29:47,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:47,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 06:29:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:47,292 INFO L225 Difference]: With dead ends: 337 [2018-12-02 06:29:47,292 INFO L226 Difference]: Without dead ends: 180 [2018-12-02 06:29:47,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-02 06:29:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2018-12-02 06:29:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 06:29:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2018-12-02 06:29:47,326 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2018-12-02 06:29:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:47,326 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2018-12-02 06:29:47,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2018-12-02 06:29:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 06:29:47,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:47,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:47,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:47,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2018-12-02 06:29:47,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:47,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:47,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:47,379 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 06:29:47,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:47,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:47,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:47,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:47,381 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2018-12-02 06:29:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:47,545 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2018-12-02 06:29:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:47,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 06:29:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:47,547 INFO L225 Difference]: With dead ends: 385 [2018-12-02 06:29:47,547 INFO L226 Difference]: Without dead ends: 221 [2018-12-02 06:29:47,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-02 06:29:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2018-12-02 06:29:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-02 06:29:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2018-12-02 06:29:47,558 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2018-12-02 06:29:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2018-12-02 06:29:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2018-12-02 06:29:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 06:29:47,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:47,560 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 06:29:47,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:47,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2018-12-02 06:29:47,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:47,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:47,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:47,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:47,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:47,616 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2018-12-02 06:29:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:47,751 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2018-12-02 06:29:47,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:47,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-02 06:29:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:47,753 INFO L225 Difference]: With dead ends: 450 [2018-12-02 06:29:47,753 INFO L226 Difference]: Without dead ends: 247 [2018-12-02 06:29:47,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-02 06:29:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-12-02 06:29:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 06:29:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2018-12-02 06:29:47,765 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2018-12-02 06:29:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:47,766 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2018-12-02 06:29:47,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2018-12-02 06:29:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 06:29:47,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:47,768 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:47,768 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:47,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2018-12-02 06:29:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:47,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:47,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:47,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:47,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:47,832 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2018-12-02 06:29:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:47,920 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2018-12-02 06:29:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:47,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 06:29:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:47,921 INFO L225 Difference]: With dead ends: 498 [2018-12-02 06:29:47,921 INFO L226 Difference]: Without dead ends: 264 [2018-12-02 06:29:47,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-02 06:29:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-12-02 06:29:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-02 06:29:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2018-12-02 06:29:47,933 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2018-12-02 06:29:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:47,933 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2018-12-02 06:29:47,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2018-12-02 06:29:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 06:29:47,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:47,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:47,934 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:47,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2018-12-02 06:29:47,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:47,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:47,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:47,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:47,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:47,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:47,985 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2018-12-02 06:29:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,103 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2018-12-02 06:29:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 06:29:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,104 INFO L225 Difference]: With dead ends: 557 [2018-12-02 06:29:48,104 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 06:29:48,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 06:29:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2018-12-02 06:29:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-02 06:29:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2018-12-02 06:29:48,113 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2018-12-02 06:29:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,114 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2018-12-02 06:29:48,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2018-12-02 06:29:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 06:29:48,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,115 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:48,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2018-12-02 06:29:48,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:48,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,152 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2018-12-02 06:29:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,250 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2018-12-02 06:29:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-02 06:29:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,252 INFO L225 Difference]: With dead ends: 597 [2018-12-02 06:29:48,252 INFO L226 Difference]: Without dead ends: 306 [2018-12-02 06:29:48,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-02 06:29:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-02 06:29:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-02 06:29:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2018-12-02 06:29:48,263 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2018-12-02 06:29:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,264 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2018-12-02 06:29:48,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2018-12-02 06:29:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 06:29:48,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,265 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:48,265 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2018-12-02 06:29:48,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,333 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2018-12-02 06:29:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,470 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2018-12-02 06:29:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-02 06:29:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,471 INFO L225 Difference]: With dead ends: 599 [2018-12-02 06:29:48,471 INFO L226 Difference]: Without dead ends: 306 [2018-12-02 06:29:48,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-02 06:29:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2018-12-02 06:29:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-12-02 06:29:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2018-12-02 06:29:48,479 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2018-12-02 06:29:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,479 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2018-12-02 06:29:48,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2018-12-02 06:29:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:29:48,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,480 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:48,480 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2018-12-02 06:29:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 06:29:48,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,514 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2018-12-02 06:29:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,609 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2018-12-02 06:29:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 06:29:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,611 INFO L225 Difference]: With dead ends: 600 [2018-12-02 06:29:48,611 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 06:29:48,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 06:29:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-12-02 06:29:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-02 06:29:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2018-12-02 06:29:48,618 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2018-12-02 06:29:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,618 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2018-12-02 06:29:48,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2018-12-02 06:29:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 06:29:48,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,619 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:48,619 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2018-12-02 06:29:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:48,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,653 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2018-12-02 06:29:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,764 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2018-12-02 06:29:48,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 06:29:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,766 INFO L225 Difference]: With dead ends: 640 [2018-12-02 06:29:48,766 INFO L226 Difference]: Without dead ends: 342 [2018-12-02 06:29:48,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-12-02 06:29:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-12-02 06:29:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-02 06:29:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2018-12-02 06:29:48,779 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2018-12-02 06:29:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,779 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2018-12-02 06:29:48,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2018-12-02 06:29:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 06:29:48,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,781 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 06:29:48,781 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2018-12-02 06:29:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,820 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2018-12-02 06:29:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:48,947 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2018-12-02 06:29:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:48,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-02 06:29:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:48,948 INFO L225 Difference]: With dead ends: 669 [2018-12-02 06:29:48,948 INFO L226 Difference]: Without dead ends: 342 [2018-12-02 06:29:48,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-12-02 06:29:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-12-02 06:29:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-02 06:29:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2018-12-02 06:29:48,957 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2018-12-02 06:29:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:48,957 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2018-12-02 06:29:48,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2018-12-02 06:29:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 06:29:48,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:48,958 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:48,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:48,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2018-12-02 06:29:48,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:48,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:48,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:48,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:48,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:48,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:48,995 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2018-12-02 06:29:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,118 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2018-12-02 06:29:49,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:49,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 06:29:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,119 INFO L225 Difference]: With dead ends: 702 [2018-12-02 06:29:49,119 INFO L226 Difference]: Without dead ends: 375 [2018-12-02 06:29:49,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-02 06:29:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2018-12-02 06:29:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-02 06:29:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2018-12-02 06:29:49,127 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2018-12-02 06:29:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,127 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2018-12-02 06:29:49,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2018-12-02 06:29:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 06:29:49,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,128 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 06:29:49,128 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2018-12-02 06:29:49,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 06:29:49,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:49,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:49,158 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2018-12-02 06:29:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,285 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2018-12-02 06:29:49,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:49,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2018-12-02 06:29:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,286 INFO L225 Difference]: With dead ends: 729 [2018-12-02 06:29:49,286 INFO L226 Difference]: Without dead ends: 375 [2018-12-02 06:29:49,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-02 06:29:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2018-12-02 06:29:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-02 06:29:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2018-12-02 06:29:49,294 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2018-12-02 06:29:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,294 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2018-12-02 06:29:49,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2018-12-02 06:29:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 06:29:49,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,295 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:49,295 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,295 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2018-12-02 06:29:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 06:29:49,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:49,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:49,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:49,335 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2018-12-02 06:29:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,452 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2018-12-02 06:29:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:49,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-02 06:29:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,453 INFO L225 Difference]: With dead ends: 747 [2018-12-02 06:29:49,453 INFO L226 Difference]: Without dead ends: 393 [2018-12-02 06:29:49,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-02 06:29:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-12-02 06:29:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-02 06:29:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2018-12-02 06:29:49,462 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2018-12-02 06:29:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,462 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2018-12-02 06:29:49,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2018-12-02 06:29:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 06:29:49,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,463 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:49,463 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2018-12-02 06:29:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 06:29:49,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:49,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:29:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:49,491 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2018-12-02 06:29:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,596 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2018-12-02 06:29:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:49,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 06:29:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,598 INFO L225 Difference]: With dead ends: 768 [2018-12-02 06:29:49,598 INFO L226 Difference]: Without dead ends: 393 [2018-12-02 06:29:49,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-02 06:29:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-12-02 06:29:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-02 06:29:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2018-12-02 06:29:49,606 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2018-12-02 06:29:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,607 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2018-12-02 06:29:49,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:29:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2018-12-02 06:29:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 06:29:49,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,608 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-12-02 06:29:49,608 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2018-12-02 06:29:49,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 06:29:49,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:49,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:49,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:49,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:49,638 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2018-12-02 06:29:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,666 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2018-12-02 06:29:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:49,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-12-02 06:29:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,668 INFO L225 Difference]: With dead ends: 763 [2018-12-02 06:29:49,668 INFO L226 Difference]: Without dead ends: 761 [2018-12-02 06:29:49,669 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 06:29:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-12-02 06:29:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2018-12-02 06:29:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-12-02 06:29:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2018-12-02 06:29:49,684 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2018-12-02 06:29:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,684 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2018-12-02 06:29:49,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2018-12-02 06:29:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 06:29:49,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,686 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-12-02 06:29:49,686 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2018-12-02 06:29:49,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 06:29:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:49,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:49,709 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2018-12-02 06:29:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,748 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2018-12-02 06:29:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:49,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-12-02 06:29:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,750 INFO L225 Difference]: With dead ends: 1877 [2018-12-02 06:29:49,751 INFO L226 Difference]: Without dead ends: 1129 [2018-12-02 06:29:49,752 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 06:29:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-12-02 06:29:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2018-12-02 06:29:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-12-02 06:29:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2018-12-02 06:29:49,774 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2018-12-02 06:29:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,774 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2018-12-02 06:29:49,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2018-12-02 06:29:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 06:29:49,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,776 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-12-02 06:29:49,776 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2018-12-02 06:29:49,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-02 06:29:49,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:49,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:49,793 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2018-12-02 06:29:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:49,836 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2018-12-02 06:29:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:49,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-12-02 06:29:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:49,840 INFO L225 Difference]: With dead ends: 2596 [2018-12-02 06:29:49,840 INFO L226 Difference]: Without dead ends: 1480 [2018-12-02 06:29:49,842 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 06:29:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2018-12-02 06:29:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2018-12-02 06:29:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-02 06:29:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2018-12-02 06:29:49,875 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2018-12-02 06:29:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:49,875 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2018-12-02 06:29:49,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2018-12-02 06:29:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 06:29:49,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:49,877 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:49,877 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:49,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2018-12-02 06:29:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:49,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 06:29:49,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:49,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:49,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:49,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:49,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:49,912 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2018-12-02 06:29:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:50,078 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2018-12-02 06:29:50,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:50,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-02 06:29:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:50,083 INFO L225 Difference]: With dead ends: 2987 [2018-12-02 06:29:50,083 INFO L226 Difference]: Without dead ends: 1520 [2018-12-02 06:29:50,085 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 06:29:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-12-02 06:29:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2018-12-02 06:29:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-02 06:29:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2018-12-02 06:29:50,130 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2018-12-02 06:29:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:50,130 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2018-12-02 06:29:50,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2018-12-02 06:29:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 06:29:50,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:50,133 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:50,133 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:50,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2018-12-02 06:29:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 06:29:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:50,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:50,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:50,172 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2018-12-02 06:29:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:50,331 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2018-12-02 06:29:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:50,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-02 06:29:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:50,335 INFO L225 Difference]: With dead ends: 3143 [2018-12-02 06:29:50,335 INFO L226 Difference]: Without dead ends: 1676 [2018-12-02 06:29:50,337 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 06:29:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-12-02 06:29:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2018-12-02 06:29:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-12-02 06:29:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2018-12-02 06:29:50,365 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2018-12-02 06:29:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:50,365 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2018-12-02 06:29:50,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2018-12-02 06:29:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 06:29:50,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:50,368 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:50,368 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:50,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2018-12-02 06:29:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-02 06:29:50,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:50,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:50,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:50,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:50,389 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2018-12-02 06:29:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:50,535 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2018-12-02 06:29:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:50,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-12-02 06:29:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:50,540 INFO L225 Difference]: With dead ends: 3195 [2018-12-02 06:29:50,540 INFO L226 Difference]: Without dead ends: 1648 [2018-12-02 06:29:50,542 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 06:29:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-12-02 06:29:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2018-12-02 06:29:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-12-02 06:29:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2018-12-02 06:29:50,588 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2018-12-02 06:29:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:50,588 INFO L480 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2018-12-02 06:29:50,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2018-12-02 06:29:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 06:29:50,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:50,591 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:50,591 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:50,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2018-12-02 06:29:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 06:29:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:50,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:50,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:50,630 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2018-12-02 06:29:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:50,738 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2018-12-02 06:29:50,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:50,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-12-02 06:29:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:50,741 INFO L225 Difference]: With dead ends: 3198 [2018-12-02 06:29:50,741 INFO L226 Difference]: Without dead ends: 1651 [2018-12-02 06:29:50,743 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 06:29:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-12-02 06:29:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2018-12-02 06:29:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-12-02 06:29:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2018-12-02 06:29:50,770 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2018-12-02 06:29:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:50,770 INFO L480 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2018-12-02 06:29:50,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2018-12-02 06:29:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 06:29:50,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:50,772 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:50,772 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2018-12-02 06:29:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-12-02 06:29:50,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:50,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:50,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:50,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:50,798 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2018-12-02 06:29:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:50,905 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2018-12-02 06:29:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:50,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-12-02 06:29:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:50,910 INFO L225 Difference]: With dead ends: 3403 [2018-12-02 06:29:50,910 INFO L226 Difference]: Without dead ends: 1787 [2018-12-02 06:29:50,912 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 06:29:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-12-02 06:29:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2018-12-02 06:29:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-02 06:29:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2018-12-02 06:29:50,947 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2018-12-02 06:29:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:50,947 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2018-12-02 06:29:50,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2018-12-02 06:29:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 06:29:50,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:50,949 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:29:50,949 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:50,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2018-12-02 06:29:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:50,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 06:29:50,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:50,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:50,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:50,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:50,977 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2018-12-02 06:29:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:51,120 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2018-12-02 06:29:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:51,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-12-02 06:29:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:51,125 INFO L225 Difference]: With dead ends: 3531 [2018-12-02 06:29:51,125 INFO L226 Difference]: Without dead ends: 1815 [2018-12-02 06:29:51,134 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 06:29:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-12-02 06:29:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2018-12-02 06:29:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-02 06:29:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2018-12-02 06:29:51,172 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2018-12-02 06:29:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:51,172 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2018-12-02 06:29:51,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2018-12-02 06:29:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-02 06:29:51,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:51,174 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:51,174 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:51,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2018-12-02 06:29:51,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-12-02 06:29:51,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:51,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:51,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:51,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:51,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:51,218 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2018-12-02 06:29:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:51,352 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2018-12-02 06:29:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:51,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-12-02 06:29:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:51,355 INFO L225 Difference]: With dead ends: 3647 [2018-12-02 06:29:51,355 INFO L226 Difference]: Without dead ends: 1831 [2018-12-02 06:29:51,357 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 06:29:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-12-02 06:29:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2018-12-02 06:29:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-12-02 06:29:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2018-12-02 06:29:51,386 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2018-12-02 06:29:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:51,386 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2018-12-02 06:29:51,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2018-12-02 06:29:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 06:29:51,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:51,388 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:51,388 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:51,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2018-12-02 06:29:51,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:51,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-12-02 06:29:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:51,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:51,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:51,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:51,428 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2018-12-02 06:29:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:51,534 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2018-12-02 06:29:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:51,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-12-02 06:29:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:51,539 INFO L225 Difference]: With dead ends: 3595 [2018-12-02 06:29:51,539 INFO L226 Difference]: Without dead ends: 1823 [2018-12-02 06:29:51,541 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 06:29:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-12-02 06:29:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2018-12-02 06:29:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-12-02 06:29:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2018-12-02 06:29:51,570 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2018-12-02 06:29:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:51,570 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2018-12-02 06:29:51,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2018-12-02 06:29:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-02 06:29:51,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:51,571 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:51,572 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2018-12-02 06:29:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:51,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-02 06:29:51,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:51,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:51,659 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-12-02 06:29:51,660 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [493], [498], [503], [509], [514], [516], [519], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:51,683 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:51,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:51,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:51,997 INFO L272 AbstractInterpreter]: Visited 91 different actions 228 times. Merged at 75 different actions 122 times. Widened at 1 different actions 1 times. Performed 1081 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 12 different actions. Largest state had 96 variables. [2018-12-02 06:29:52,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:52,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:52,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:52,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 06:29:52,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:52,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:52,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-02 06:29:52,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-02 06:29:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 06:29:52,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 06:29:52,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:52,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:52,156 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 3 states. [2018-12-02 06:29:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:52,240 INFO L93 Difference]: Finished difference Result 3585 states and 4844 transitions. [2018-12-02 06:29:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:52,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-12-02 06:29:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:52,244 INFO L225 Difference]: With dead ends: 3585 [2018-12-02 06:29:52,245 INFO L226 Difference]: Without dead ends: 2246 [2018-12-02 06:29:52,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 501 SyntacticMatches, 1 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 06:29:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-12-02 06:29:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-12-02 06:29:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-02 06:29:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3031 transitions. [2018-12-02 06:29:52,292 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3031 transitions. Word has length 251 [2018-12-02 06:29:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:52,292 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 3031 transitions. [2018-12-02 06:29:52,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3031 transitions. [2018-12-02 06:29:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-02 06:29:52,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:52,296 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 06:29:52,296 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:52,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2018-12-02 06:29:52,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:52,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:52,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:52,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:52,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 06:29:52,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:52,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:52,338 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-12-02 06:29:52,339 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:52,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:52,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:52,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:52,489 INFO L272 AbstractInterpreter]: Visited 77 different actions 202 times. Merged at 64 different actions 115 times. Widened at 2 different actions 2 times. Performed 965 root evaluator evaluations with a maximum evaluation depth of 3. Performed 965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 14 fixpoints after 7 different actions. Largest state had 94 variables. [2018-12-02 06:29:52,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:52,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:52,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:52,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 06:29:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:52,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:52,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 06:29:52,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 06:29:52,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 06:29:52,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 06:29:52,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 06:29:52,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:29:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:29:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:52,625 INFO L87 Difference]: Start difference. First operand 2246 states and 3031 transitions. Second operand 4 states. [2018-12-02 06:29:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:52,916 INFO L93 Difference]: Finished difference Result 7160 states and 9675 transitions. [2018-12-02 06:29:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:52,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-12-02 06:29:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:52,927 INFO L225 Difference]: With dead ends: 7160 [2018-12-02 06:29:52,927 INFO L226 Difference]: Without dead ends: 4933 [2018-12-02 06:29:52,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 516 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 06:29:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2018-12-02 06:29:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 2791. [2018-12-02 06:29:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2018-12-02 06:29:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3681 transitions. [2018-12-02 06:29:52,997 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3681 transitions. Word has length 258 [2018-12-02 06:29:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:52,997 INFO L480 AbstractCegarLoop]: Abstraction has 2791 states and 3681 transitions. [2018-12-02 06:29:52,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:29:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3681 transitions. [2018-12-02 06:29:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-02 06:29:53,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:53,000 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 06:29:53,000 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:53,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2018-12-02 06:29:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 06:29:53,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:53,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:53,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:53,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:53,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:53,055 INFO L87 Difference]: Start difference. First operand 2791 states and 3681 transitions. Second operand 3 states. [2018-12-02 06:29:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:53,163 INFO L93 Difference]: Finished difference Result 7820 states and 10371 transitions. [2018-12-02 06:29:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:53,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2018-12-02 06:29:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:53,172 INFO L225 Difference]: With dead ends: 7820 [2018-12-02 06:29:53,172 INFO L226 Difference]: Without dead ends: 5048 [2018-12-02 06:29:53,175 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 06:29:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2018-12-02 06:29:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5046. [2018-12-02 06:29:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-02 06:29:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 6701 transitions. [2018-12-02 06:29:53,281 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 6701 transitions. Word has length 258 [2018-12-02 06:29:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:53,281 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 6701 transitions. [2018-12-02 06:29:53,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 6701 transitions. [2018-12-02 06:29:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-02 06:29:53,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:53,284 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 06:29:53,284 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2018-12-02 06:29:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:53,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:53,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:53,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:53,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:53,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:53,321 INFO L87 Difference]: Start difference. First operand 5046 states and 6701 transitions. Second operand 3 states. [2018-12-02 06:29:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:53,524 INFO L93 Difference]: Finished difference Result 10199 states and 13538 transitions. [2018-12-02 06:29:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:53,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-12-02 06:29:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:53,533 INFO L225 Difference]: With dead ends: 10199 [2018-12-02 06:29:53,533 INFO L226 Difference]: Without dead ends: 5172 [2018-12-02 06:29:53,539 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 06:29:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2018-12-02 06:29:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5047. [2018-12-02 06:29:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-12-02 06:29:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6617 transitions. [2018-12-02 06:29:53,637 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6617 transitions. Word has length 261 [2018-12-02 06:29:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:53,637 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6617 transitions. [2018-12-02 06:29:53,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6617 transitions. [2018-12-02 06:29:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-12-02 06:29:53,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:53,640 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 06:29:53,641 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:53,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2018-12-02 06:29:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:53,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:53,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:53,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:53,715 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-12-02 06:29:53,715 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [269], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:53,718 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:53,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:53,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:53,882 INFO L272 AbstractInterpreter]: Visited 84 different actions 218 times. Merged at 65 different actions 119 times. Widened at 3 different actions 3 times. Performed 1021 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1021 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 8 different actions. Largest state had 95 variables. [2018-12-02 06:29:53,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:53,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:53,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:53,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 06:29:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:53,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:53,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-12-02 06:29:53,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-12-02 06:29:54,015 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 06:29:54,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 06:29:54,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:54,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:54,016 INFO L87 Difference]: Start difference. First operand 5047 states and 6617 transitions. Second operand 3 states. [2018-12-02 06:29:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:54,168 INFO L93 Difference]: Finished difference Result 10094 states and 13226 transitions. [2018-12-02 06:29:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:54,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-12-02 06:29:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:54,173 INFO L225 Difference]: With dead ends: 10094 [2018-12-02 06:29:54,173 INFO L226 Difference]: Without dead ends: 5067 [2018-12-02 06:29:54,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-12-02 06:29:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5047. [2018-12-02 06:29:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-12-02 06:29:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6607 transitions. [2018-12-02 06:29:54,272 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6607 transitions. Word has length 287 [2018-12-02 06:29:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6607 transitions. [2018-12-02 06:29:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6607 transitions. [2018-12-02 06:29:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-02 06:29:54,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:54,276 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 06:29:54,276 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:54,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2018-12-02 06:29:54,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:54,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:54,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:54,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:54,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:54,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:54,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:54,358 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-12-02 06:29:54,359 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:54,360 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:54,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:54,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:54,501 INFO L272 AbstractInterpreter]: Visited 84 different actions 277 times. Merged at 71 different actions 169 times. Widened at 3 different actions 3 times. Performed 1193 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 22 fixpoints after 12 different actions. Largest state had 95 variables. [2018-12-02 06:29:54,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:54,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:54,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:54,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/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 06:29:54,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:54,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:54,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-12-02 06:29:54,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-12-02 06:29:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 06:29:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 06:29:54,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:54,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:54,629 INFO L87 Difference]: Start difference. First operand 5047 states and 6607 transitions. Second operand 3 states. [2018-12-02 06:29:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:54,766 INFO L93 Difference]: Finished difference Result 10074 states and 13186 transitions. [2018-12-02 06:29:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:54,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-12-02 06:29:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:54,771 INFO L225 Difference]: With dead ends: 10074 [2018-12-02 06:29:54,771 INFO L226 Difference]: Without dead ends: 5047 [2018-12-02 06:29:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 576 SyntacticMatches, 1 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 06:29:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2018-12-02 06:29:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2018-12-02 06:29:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-12-02 06:29:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6597 transitions. [2018-12-02 06:29:54,869 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6597 transitions. Word has length 288 [2018-12-02 06:29:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:54,869 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6597 transitions. [2018-12-02 06:29:54,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6597 transitions. [2018-12-02 06:29:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-02 06:29:54,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:54,873 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 06:29:54,873 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:54,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2018-12-02 06:29:54,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:54,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:54,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:54,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:54,912 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-12-02 06:29:54,912 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [55], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:54,913 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:54,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:55,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:55,060 INFO L272 AbstractInterpreter]: Visited 83 different actions 221 times. Merged at 69 different actions 123 times. Widened at 3 different actions 3 times. Performed 1039 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1039 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 8 different actions. Largest state had 95 variables. [2018-12-02 06:29:55,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:55,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:55,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:55,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:29:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:55,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:55,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:55,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 06:29:55,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 06:29:55,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 06:29:55,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 06:29:55,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:29:55,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:29:55,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:55,195 INFO L87 Difference]: Start difference. First operand 5047 states and 6597 transitions. Second operand 4 states. [2018-12-02 06:29:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:55,506 INFO L93 Difference]: Finished difference Result 11856 states and 15438 transitions. [2018-12-02 06:29:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:55,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-12-02 06:29:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:55,511 INFO L225 Difference]: With dead ends: 11856 [2018-12-02 06:29:55,511 INFO L226 Difference]: Without dead ends: 6763 [2018-12-02 06:29:55,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 576 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 06:29:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2018-12-02 06:29:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 4456. [2018-12-02 06:29:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2018-12-02 06:29:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5756 transitions. [2018-12-02 06:29:55,612 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5756 transitions. Word has length 288 [2018-12-02 06:29:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:55,613 INFO L480 AbstractCegarLoop]: Abstraction has 4456 states and 5756 transitions. [2018-12-02 06:29:55,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:29:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5756 transitions. [2018-12-02 06:29:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-02 06:29:55,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:55,616 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-02 06:29:55,616 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:55,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2018-12-02 06:29:55,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:55,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:55,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:55,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:55,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-12-02 06:29:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:55,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:55,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:55,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:55,672 INFO L87 Difference]: Start difference. First operand 4456 states and 5756 transitions. Second operand 3 states. [2018-12-02 06:29:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:55,816 INFO L93 Difference]: Finished difference Result 7492 states and 9566 transitions. [2018-12-02 06:29:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:55,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-12-02 06:29:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:55,819 INFO L225 Difference]: With dead ends: 7492 [2018-12-02 06:29:55,819 INFO L226 Difference]: Without dead ends: 2273 [2018-12-02 06:29:55,822 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 06:29:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2018-12-02 06:29:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2018-12-02 06:29:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2018-12-02 06:29:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2893 transitions. [2018-12-02 06:29:55,875 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2893 transitions. Word has length 326 [2018-12-02 06:29:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:55,875 INFO L480 AbstractCegarLoop]: Abstraction has 2273 states and 2893 transitions. [2018-12-02 06:29:55,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2893 transitions. [2018-12-02 06:29:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-12-02 06:29:55,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:55,877 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:55,877 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:55,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2018-12-02 06:29:55,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:55,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-12-02 06:29:55,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:55,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:55,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:55,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:55,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:55,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:55,927 INFO L87 Difference]: Start difference. First operand 2273 states and 2893 transitions. Second operand 3 states. [2018-12-02 06:29:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:56,028 INFO L93 Difference]: Finished difference Result 4511 states and 5729 transitions. [2018-12-02 06:29:56,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:56,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-12-02 06:29:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:56,029 INFO L225 Difference]: With dead ends: 4511 [2018-12-02 06:29:56,029 INFO L226 Difference]: Without dead ends: 2283 [2018-12-02 06:29:56,031 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 06:29:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2018-12-02 06:29:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2273. [2018-12-02 06:29:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2018-12-02 06:29:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2868 transitions. [2018-12-02 06:29:56,071 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2868 transitions. Word has length 365 [2018-12-02 06:29:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:56,071 INFO L480 AbstractCegarLoop]: Abstraction has 2273 states and 2868 transitions. [2018-12-02 06:29:56,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2868 transitions. [2018-12-02 06:29:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-12-02 06:29:56,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:56,073 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:56,073 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:56,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2018-12-02 06:29:56,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:56,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:56,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:56,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:56,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-02 06:29:56,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:56,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:56,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-12-02 06:29:56,163 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:56,165 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:56,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:56,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:56,295 INFO L272 AbstractInterpreter]: Visited 101 different actions 260 times. Merged at 86 different actions 141 times. Widened at 3 different actions 3 times. Performed 1255 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 14 different actions. Largest state had 97 variables. [2018-12-02 06:29:56,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:56,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:56,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:56,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:29:56,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:56,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:56,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-12-02 06:29:56,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-12-02 06:29:56,498 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 06:29:56,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 06:29:56,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:56,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:56,499 INFO L87 Difference]: Start difference. First operand 2273 states and 2868 transitions. Second operand 3 states. [2018-12-02 06:29:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:56,547 INFO L93 Difference]: Finished difference Result 2892 states and 3673 transitions. [2018-12-02 06:29:56,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:56,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2018-12-02 06:29:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:56,549 INFO L225 Difference]: With dead ends: 2892 [2018-12-02 06:29:56,549 INFO L226 Difference]: Without dead ends: 2800 [2018-12-02 06:29:56,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 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 06:29:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2018-12-02 06:29:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2183. [2018-12-02 06:29:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2018-12-02 06:29:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2767 transitions. [2018-12-02 06:29:56,599 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2767 transitions. Word has length 398 [2018-12-02 06:29:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:56,599 INFO L480 AbstractCegarLoop]: Abstraction has 2183 states and 2767 transitions. [2018-12-02 06:29:56,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2767 transitions. [2018-12-02 06:29:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-12-02 06:29:56,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:56,602 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 06:29:56,602 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:56,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2018-12-02 06:29:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:56,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-12-02 06:29:56,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:56,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:56,729 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 539 with the following transitions: [2018-12-02 06:29:56,729 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:56,730 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:56,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:56,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:56,884 INFO L272 AbstractInterpreter]: Visited 100 different actions 328 times. Merged at 84 different actions 203 times. Widened at 2 different actions 2 times. Performed 1434 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 15 different actions. Largest state had 97 variables. [2018-12-02 06:29:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:56,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:56,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:56,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:29:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:56,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:56,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-12-02 06:29:57,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-12-02 06:29:57,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 06:29:57,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 06:29:57,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 06:29:57,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:29:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:29:57,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:57,175 INFO L87 Difference]: Start difference. First operand 2183 states and 2767 transitions. Second operand 4 states. [2018-12-02 06:29:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:57,366 INFO L93 Difference]: Finished difference Result 5269 states and 6675 transitions. [2018-12-02 06:29:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:57,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2018-12-02 06:29:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:57,368 INFO L225 Difference]: With dead ends: 5269 [2018-12-02 06:29:57,368 INFO L226 Difference]: Without dead ends: 3089 [2018-12-02 06:29:57,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1076 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 06:29:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2018-12-02 06:29:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2243. [2018-12-02 06:29:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-12-02 06:29:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2847 transitions. [2018-12-02 06:29:57,417 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2847 transitions. Word has length 538 [2018-12-02 06:29:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:57,417 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 2847 transitions. [2018-12-02 06:29:57,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:29:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2847 transitions. [2018-12-02 06:29:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-12-02 06:29:57,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:57,420 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 06:29:57,420 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:57,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2018-12-02 06:29:57,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:57,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:57,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2018-12-02 06:29:57,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:57,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:57,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:57,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:57,538 INFO L87 Difference]: Start difference. First operand 2243 states and 2847 transitions. Second operand 3 states. [2018-12-02 06:29:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:57,652 INFO L93 Difference]: Finished difference Result 4621 states and 5867 transitions. [2018-12-02 06:29:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:57,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2018-12-02 06:29:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:57,654 INFO L225 Difference]: With dead ends: 4621 [2018-12-02 06:29:57,654 INFO L226 Difference]: Without dead ends: 2423 [2018-12-02 06:29:57,655 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 06:29:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2018-12-02 06:29:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2413. [2018-12-02 06:29:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-12-02 06:29:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3042 transitions. [2018-12-02 06:29:57,702 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3042 transitions. Word has length 600 [2018-12-02 06:29:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:57,702 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 3042 transitions. [2018-12-02 06:29:57,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3042 transitions. [2018-12-02 06:29:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-12-02 06:29:57,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:57,706 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 06:29:57,706 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:57,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2018-12-02 06:29:57,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2018-12-02 06:29:57,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:29:57,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:29:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:29:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:29:57,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:29:57,829 INFO L87 Difference]: Start difference. First operand 2413 states and 3042 transitions. Second operand 3 states. [2018-12-02 06:29:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:57,930 INFO L93 Difference]: Finished difference Result 4778 states and 6009 transitions. [2018-12-02 06:29:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:29:57,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2018-12-02 06:29:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:57,933 INFO L225 Difference]: With dead ends: 4778 [2018-12-02 06:29:57,933 INFO L226 Difference]: Without dead ends: 2410 [2018-12-02 06:29:57,934 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 06:29:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2018-12-02 06:29:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2018-12-02 06:29:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2018-12-02 06:29:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2987 transitions. [2018-12-02 06:29:57,980 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2987 transitions. Word has length 662 [2018-12-02 06:29:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:57,980 INFO L480 AbstractCegarLoop]: Abstraction has 2408 states and 2987 transitions. [2018-12-02 06:29:57,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:29:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2987 transitions. [2018-12-02 06:29:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-12-02 06:29:57,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:29:57,983 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 06:29:57,983 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:29:57,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2018-12-02 06:29:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:29:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:57,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:29:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-12-02 06:29:58,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:58,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:29:58,182 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 729 with the following transitions: [2018-12-02 06:29:58,183 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [447], [452], [457], [462], [465], [470], [472], [477], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-12-02 06:29:58,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:29:58,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:29:58,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:29:58,351 INFO L272 AbstractInterpreter]: Visited 111 different actions 361 times. Merged at 92 different actions 219 times. Widened at 2 different actions 2 times. Performed 1642 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1642 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 18 different actions. Largest state had 101 variables. [2018-12-02 06:29:58,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:58,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:29:58,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:58,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:29:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:58,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:29:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:58,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-12-02 06:29:58,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:29:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-12-02 06:29:58,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 06:29:58,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 06:29:58,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 06:29:58,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:29:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:29:58,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:29:58,710 INFO L87 Difference]: Start difference. First operand 2408 states and 2987 transitions. Second operand 4 states. [2018-12-02 06:29:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:58,813 INFO L93 Difference]: Finished difference Result 4118 states and 5143 transitions. [2018-12-02 06:29:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:29:58,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2018-12-02 06:29:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:29:58,814 INFO L225 Difference]: With dead ends: 4118 [2018-12-02 06:29:58,814 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 06:29:58,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1456 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 06:29:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 06:29:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 06:29:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 06:29:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 06:29:58,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2018-12-02 06:29:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:29:58,818 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:58,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:29:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:29:58,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 06:29:58,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 06:29:58,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:58,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:58,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:58,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:58,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:58,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,640 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 466 DAG size of output: 273 [2018-12-02 06:29:59,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:29:59,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,190 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 274 [2018-12-02 06:30:00,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 06:30:00,875 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-12-02 06:30:01,168 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 60 [2018-12-02 06:30:01,527 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2018-12-02 06:30:01,966 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-12-02 06:30:02,243 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-12-02 06:30:02,424 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2018-12-02 06:30:02,783 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-12-02 06:30:03,193 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-12-02 06:30:06,006 WARN L180 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 220 DAG size of output: 138 [2018-12-02 06:30:06,328 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2018-12-02 06:30:08,603 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 221 DAG size of output: 136 [2018-12-02 06:30:09,051 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2018-12-02 06:30:09,893 WARN L180 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-12-02 06:30:10,672 WARN L180 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 54 [2018-12-02 06:30:10,908 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2018-12-02 06:30:11,281 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2018-12-02 06:30:11,538 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2018-12-02 06:30:12,264 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-12-02 06:30:13,708 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 114 DAG size of output: 58 [2018-12-02 06:30:16,499 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 158 DAG size of output: 78 [2018-12-02 06:30:16,785 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-12-02 06:30:16,790 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 06:30:16,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 06:30:16,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 06:30:16,790 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 06:30:16,790 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 06:30:16,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 06:30:16,790 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 612 623) the Hoare annotation is: true [2018-12-02 06:30:16,790 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 612 623) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L444 ceAbstractionStarter]: At program point L619(line 619) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L619-1(line 619) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 612 623) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 436) no Hoare annotation was computed. [2018-12-02 06:30:16,791 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 372) no Hoare annotation was computed. [2018-12-02 06:30:16,792 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse4 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse1 (not (= 8656 ssl3_accept_~s__state~0))) (.cse2 (not (= 12292 ssl3_accept_~s__state~0))) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8480) (and .cse4 .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (and .cse4 .cse0 .cse1 .cse2 (not (= ssl3_accept_~s__hit~0 0)) .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 (= ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,792 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-12-02 06:30:16,792 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2018-12-02 06:30:16,792 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2018-12-02 06:30:16,792 INFO L444 ceAbstractionStarter]: At program point L401(lines 392 410) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 371) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L448 ceAbstractionStarter]: For program point L337-1(lines 337 371) no Hoare annotation was computed. [2018-12-02 06:30:16,793 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (not (= 8672 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-12-02 06:30:16,794 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 557) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 (= ssl3_accept_~s__hit~0 0) .cse4 .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,794 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ssl3_accept_~s__state~0))) (.cse5 (not (= 8480 ssl3_accept_~s__state~0))) (.cse6 (<= 8448 ssl3_accept_~s__state~0)) (.cse7 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8481 ssl3_accept_~s__state~0))) (.cse9 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ssl3_accept_~blastFlag~0 0) .cse9) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse9 (and .cse0 .cse1 .cse2 (= ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse8)) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 (= ssl3_accept_~s__hit~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,794 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 472) no Hoare annotation was computed. [2018-12-02 06:30:16,794 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2018-12-02 06:30:16,794 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 368) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (not (= 8672 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2018-12-02 06:30:16,795 INFO L451 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 611) the Hoare annotation is: true [2018-12-02 06:30:16,795 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 308 315) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 366) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-12-02 06:30:16,796 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse10 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ssl3_accept_~s__state~0))) (.cse7 (not (= 8561 ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse8 .cse9) .cse10) (= |ssl3_accept_#in~initial_state| 8656) (and .cse1 .cse2 (not (= 8673 ssl3_accept_~s__state~0)) .cse3 (not (= 8672 ssl3_accept_~s__state~0)) .cse4 .cse5 (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse6 .cse7 .cse8 .cse9 (= ssl3_accept_~blastFlag~0 0) (not (= 12292 ssl3_accept_~s__state~0))) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496))) [2018-12-02 06:30:16,796 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 (= ssl3_accept_~s__hit~0 0) .cse4 .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496))) [2018-12-02 06:30:16,797 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0))) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,797 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse31 (= |ssl3_accept_#in~initial_state| 8496)) (.cse4 (= |ssl3_accept_#in~initial_state| 8497)) (.cse27 (= |ssl3_accept_#in~initial_state| 8561)) (.cse26 (= |ssl3_accept_#in~initial_state| 8544)) (.cse21 (= |ssl3_accept_#in~initial_state| 12292))) (let ((.cse18 (= ssl3_accept_~s__hit~0 0)) (.cse35 (= |ssl3_accept_#in~initial_state| 8673)) (.cse33 (= |ssl3_accept_#in~initial_state| 8480)) (.cse37 (= |ssl3_accept_#in~initial_state| 8560)) (.cse34 (= |ssl3_accept_#in~initial_state| 8448)) (.cse1 (= ssl3_accept_~blastFlag~0 1)) (.cse36 (= |ssl3_accept_#in~initial_state| 8672)) (.cse39 (not (= 8560 ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ssl3_accept_~s__state~0))) (.cse40 (not .cse21)) (.cse41 (<= 8512 ssl3_accept_~s__state~0)) (.cse14 (<= ssl3_accept_~s__state~0 8640)) (.cse42 (not .cse26)) (.cse43 (not .cse27)) (.cse8 (not (= 8561 ssl3_accept_~s__state~0))) (.cse44 (not .cse4)) (.cse28 (= ssl3_accept_~blastFlag~0 0)) (.cse45 (not .cse31))) (let ((.cse6 (not (= 8497 ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse25 (= ssl3_accept_~s__state~0 8592)) (.cse30 (and .cse39 .cse5 .cse40 .cse41 .cse14 .cse42 .cse43 .cse8 .cse44 .cse28 .cse45)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse15 (<= 8640 ssl3_accept_~s__state~0)) (.cse12 (<= ssl3_accept_~s__state~0 8576)) (.cse17 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse38 (<= ssl3_accept_~s__state~0 3)) (.cse23 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse13 (<= ssl3_accept_~blastFlag~0 2)) (.cse24 (and (not .cse35) (not .cse33) .cse39 (not .cse37) .cse5 (not .cse34) (not (= 8544 ssl3_accept_~s__state~0)) .cse40 .cse41 .cse14 .cse42 .cse1 .cse43 .cse8 .cse44 .cse45 (not .cse36))) (.cse32 (= ssl3_accept_~s__state~0 8608)) (.cse10 (<= 8448 ssl3_accept_~s__state~0)) (.cse29 (<= ssl3_accept_~s__state~0 8448)) (.cse19 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse20 (not (= 8656 ssl3_accept_~s__state~0))) (.cse16 (not .cse18)) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse14 .cse15 .cse17) (and (= ssl3_accept_~s__state~0 8544) .cse13 .cse18) (and .cse19 .cse0 .cse20 .cse17 .cse2 .cse3) .cse21 (and .cse13 .cse22 .cse16 .cse3) (and .cse19 .cse22 .cse23 .cse16 .cse3) (and .cse24 .cse25) .cse26 (and (= ssl3_accept_~s__state~0 8528) .cse13 .cse18) .cse27 (and .cse13 .cse18 .cse17 .cse25) (and .cse12 (and .cse5 (not (= 8496 ssl3_accept_~s__state~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28)) (and .cse14 .cse15 .cse28) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse10 .cse23 .cse16 .cse29) (and .cse25 .cse30) .cse31 (and .cse32 .cse30) (and .cse14 .cse1 .cse15) (and .cse17 .cse12 .cse1) .cse33 .cse34 .cse35 (and .cse13 .cse17 .cse12 .cse18) (and (and .cse13 .cse22 .cse3) .cse17) (and .cse14 .cse15 .cse23 .cse16) .cse36 .cse37 (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8560)) (and .cse13 .cse38) (and .cse17 .cse28 .cse12) (and .cse13 .cse18 .cse17 .cse32) (and .cse0 .cse28 .cse2 .cse3) (and .cse38 .cse23) (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8512)) (and .cse24 .cse32) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse18 .cse19 .cse10 .cse29) (= |ssl3_accept_#in~initial_state| 8656) (and .cse19 .cse0 .cse20 .cse16 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657))))) [2018-12-02 06:30:16,797 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 446) no Hoare annotation was computed. [2018-12-02 06:30:16,797 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-12-02 06:30:16,797 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2018-12-02 06:30:16,797 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2018-12-02 06:30:16,797 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L346-2(lines 346 350) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 412) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 456) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2018-12-02 06:30:16,798 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-12-02 06:30:16,799 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__state~0 8608))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__hit~0 0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0) (= |ssl3_accept_#in~initial_state| 8673) (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (<= 8512 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8640) (not (= 8561 ssl3_accept_~s__state~0)) (= ssl3_accept_~blastFlag~0 0)) (and (= ssl3_accept_~blastFlag~0 1) .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,799 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (and .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 544) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 544) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2018-12-02 06:30:16,799 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 453) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ssl3_accept_~s__state~0)) (.cse8 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ssl3_accept_~blastFlag~0 0) .cse9) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 611) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 362) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-02 06:30:16,800 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2018-12-02 06:30:16,801 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2018-12-02 06:30:16,801 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2018-12-02 06:30:16,801 INFO L444 ceAbstractionStarter]: At program point L355(lines 331 373) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (and .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,801 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 12292) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and (not (= 8656 ssl3_accept_~s__state~0)) .cse2 (<= ssl3_accept_~s__state~0 8656) (= ssl3_accept_~blastFlag~0 0)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse1 (= ssl3_accept_~blastFlag~0 1) .cse2))) [2018-12-02 06:30:16,801 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-12-02 06:30:16,801 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (<= ssl3_accept_~s__state~0 8640)) (.cse6 (not (= 8448 ssl3_accept_~s__state~0))) (.cse7 (not (= 8561 ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ssl3_accept_~s__state~0)) (.cse10 (not (= 8481 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,801 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-02 06:30:16,801 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 424) no Hoare annotation was computed. [2018-12-02 06:30:16,801 INFO L444 ceAbstractionStarter]: At program point L389(lines 380 412) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 208 542) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 611) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L325-2(lines 208 542) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 410) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 399) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2018-12-02 06:30:16,802 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse4 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8672 ssl3_accept_~s__state~0))) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8673) (and .cse1 (<= ssl3_accept_~blastFlag~0 3) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse2 .cse3) (and .cse1 (= ssl3_accept_~blastFlag~0 1) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,803 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 (= ssl3_accept_~blastFlag~0 0) .cse3)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 (and .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 1))) (and .cse0 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3)))) [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2018-12-02 06:30:16,803 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse18 (= ssl3_accept_~s__hit~0 0)) (.cse33 (= |ssl3_accept_#in~initial_state| 8673)) (.cse31 (= |ssl3_accept_#in~initial_state| 8480)) (.cse35 (= |ssl3_accept_#in~initial_state| 8560)) (.cse5 (not (= 8545 ssl3_accept_~s__state~0))) (.cse32 (= |ssl3_accept_#in~initial_state| 8448)) (.cse21 (= |ssl3_accept_#in~initial_state| 12292)) (.cse14 (<= ssl3_accept_~s__state~0 8640)) (.cse26 (= |ssl3_accept_#in~initial_state| 8544)) (.cse1 (= ssl3_accept_~blastFlag~0 1)) (.cse28 (= |ssl3_accept_#in~initial_state| 8561)) (.cse8 (not (= 8561 ssl3_accept_~s__state~0))) (.cse4 (= |ssl3_accept_#in~initial_state| 8497)) (.cse30 (= |ssl3_accept_#in~initial_state| 8496)) (.cse34 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse6 (not (= 8497 ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse25 (= ssl3_accept_~s__state~0 8592)) (.cse12 (<= ssl3_accept_~s__state~0 8576)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse15 (<= 8640 ssl3_accept_~s__state~0)) (.cse27 (= ssl3_accept_~blastFlag~0 0)) (.cse17 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse36 (<= ssl3_accept_~s__state~0 3)) (.cse23 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse13 (<= ssl3_accept_~blastFlag~0 2)) (.cse24 (and (not .cse33) (not .cse31) (not (= 8560 ssl3_accept_~s__state~0)) (not .cse35) .cse5 (not .cse32) (not (= 8544 ssl3_accept_~s__state~0)) (not .cse21) (<= 8512 ssl3_accept_~s__state~0) .cse14 (not .cse26) .cse1 (not .cse28) .cse8 (not .cse4) (not .cse30) (not .cse34))) (.cse37 (= ssl3_accept_~s__state~0 8608)) (.cse10 (<= 8448 ssl3_accept_~s__state~0)) (.cse29 (<= ssl3_accept_~s__state~0 8448)) (.cse19 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse20 (not (= 8656 ssl3_accept_~s__state~0))) (.cse16 (not .cse18)) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse14 .cse15 .cse17) (and (= ssl3_accept_~s__state~0 8544) .cse13 .cse18) (and .cse19 .cse0 .cse20 .cse17 .cse2 .cse3) .cse21 (and .cse13 .cse22 .cse16 .cse3) (and .cse19 .cse22 .cse23 .cse16 .cse3) (and .cse24 .cse25) .cse26 (and (= ssl3_accept_~s__state~0 8528) .cse13 .cse18) (and .cse5 (not (= 8673 ssl3_accept_~s__state~0)) (not (= 8496 ssl3_accept_~s__state~0)) .cse6 .cse0 .cse7 .cse8 .cse9 .cse11 .cse27 (not (= 12292 ssl3_accept_~s__state~0))) .cse28 (and .cse13 .cse18 .cse17 .cse25) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse10 .cse23 .cse16 .cse29) .cse30 (and .cse14 .cse1 .cse15) (and .cse17 .cse12 .cse1) .cse31 .cse32 .cse33 (and .cse13 .cse17 .cse12 .cse18) (and (and .cse13 .cse22 .cse3) .cse17) (and .cse14 .cse15 .cse23 .cse16) .cse34 .cse35 (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8560)) (and .cse13 .cse36) (and .cse17 .cse27 .cse14) (and .cse13 .cse18 .cse17 .cse37) (and .cse36 .cse23) (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8512)) (and .cse24 .cse37) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse18 .cse19 .cse10 .cse29) (= |ssl3_accept_#in~initial_state| 8656) (and .cse19 .cse0 .cse20 .cse16 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657)))) [2018-12-02 06:30:16,803 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 430 438) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__hit~0 0)) (.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__state~0 8448))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (and (= ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse0 .cse1 .cse2) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse3) .cse2) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse0 .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,804 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ssl3_accept_~s__state~0))) (.cse7 (not (= 8561 ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ssl3_accept_~s__state~0)) (.cse10 (not (= 8481 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse8 .cse9 .cse10)) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 .cse9 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse0) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ssl3_accept_~blastFlag~0 0))) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2018-12-02 06:30:16,804 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 208 542) no Hoare annotation was computed. [2018-12-02 06:30:16,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:30:16 BoogieIcfgContainer [2018-12-02 06:30:16,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:30:16,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:30:16,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:30:16,841 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:30:16,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:46" (3/4) ... [2018-12-02 06:30:16,845 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 06:30:16,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 06:30:16,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 06:30:16,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_accept [2018-12-02 06:30:16,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-02 06:30:16,856 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 06:30:16,857 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || ((((((((((!(8545 == s__state) && !(8673 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8640)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((s__state <= 8576 && s__hit == 0) && blastFlag <= 2 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8576 && ((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8656) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(8481 == s__state))) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (s__state <= 8576 && (((((((!(8545 == s__state) && !(8496 == s__state)) && !(8497 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (s__state == 8592 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || \old(initial_state) == 8496) || (s__state == 8608 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (((!(8657 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 [2018-12-02 06:30:16,878 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (s__state <= 8576 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && blastFlag == 0) && 8512 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__hit == 0) && ((blastFlag <= 2 && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((blastFlag == 1 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || ((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (((8448 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 [2018-12-02 06:30:16,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || (blastFlag == 1 && s__state == 8608)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((!(8656 == s__state) && 8640 <= s__state) && s__state <= 8656) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state) [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((blastFlag <= 2 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8673) || (((((!(8672 == s__state) && blastFlag <= 3) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || (((!(8672 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state)) || ((((blastFlag <= 2 && !(8672 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((!(8672 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(8657 == s__state) && !(8656 == s__state)) && blastFlag == 0) && !(12292 == s__state)) && 8656 <= s__state) || \old(initial_state) == 8480) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((((!(8657 == s__state) && blastFlag == 1) && !(8656 == s__state)) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-12-02 06:30:16,918 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74ba94d6-b462-4bc4-8049-fe86b04c1ead/bin-2019/utaipan/witness.graphml [2018-12-02 06:30:16,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:30:16,919 INFO L168 Benchmark]: Toolchain (without parser) took 30732.11 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 950.8 MB in the beginning and 1.4 GB in the end (delta: -408.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 06:30:16,919 INFO L168 Benchmark]: CDTParser took 0.14 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 06:30:16,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:30:16,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.26 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 06:30:16,920 INFO L168 Benchmark]: Boogie Preprocessor took 28.34 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 06:30:16,920 INFO L168 Benchmark]: RCFGBuilder took 386.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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:30:16,920 INFO L168 Benchmark]: TraceAbstraction took 29976.25 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -341.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 06:30:16,920 INFO L168 Benchmark]: Witness Printer took 77.03 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:30:16,921 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.14 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 246.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.26 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 28.34 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 386.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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29976.25 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -341.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 77.03 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || (blastFlag == 1 && s__state == 8608)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((blastFlag == 1 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || ((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (((8448 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(8481 == s__state))) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((!(8656 == s__state) && 8640 <= s__state) && s__state <= 8656) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (s__state <= 8576 && (((((((!(8545 == s__state) && !(8496 == s__state)) && !(8497 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (s__state == 8592 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || \old(initial_state) == 8496) || (s__state == 8608 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (((!(8657 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (s__state <= 8576 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || ((((((((((!(8545 == s__state) && !(8673 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8640)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && blastFlag == 0) && 8512 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__hit == 0) && ((blastFlag <= 2 && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((blastFlag <= 2 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8673) || (((((!(8672 == s__state) && blastFlag <= 3) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || (((!(8672 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state)) || ((((blastFlag <= 2 && !(8672 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((!(8672 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((s__state <= 8576 && s__hit == 0) && blastFlag <= 2 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8576 && ((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8656) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8657 == s__state) && !(8656 == s__state)) && blastFlag == 0) && !(12292 == s__state)) && 8656 <= s__state) || \old(initial_state) == 8480) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((((!(8657 == s__state) && blastFlag == 1) && !(8656 == s__state)) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 151 locations, 1 error locations. SAFE Result, 29.9s OverallTime, 39 OverallIterations, 24 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 17.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 7879 SDtfs, 7830 SDslu, 5854 SDs, 0 SdLazy, 4975 SolverSat, 1077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6240 GetRequests, 6133 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5047occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 6591 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 261 NumberOfFragments, 4127 HoareAnnotationTreeSize, 32 FomulaSimplifications, 648306 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 32 FomulaSimplificationsInter, 448657 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 11812 NumberOfCodeBlocks, 11812 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 14793 ConstructedInterpolants, 0 QuantifiedInterpolants, 7250364 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5324 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 55 InterpolantComputations, 39 PerfectInterpolantSequences, 58694/58938 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...