./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41b53a8be36a107d9ce8e745364368cfe44e748b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:03,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:03,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:03,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:03,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:03,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:03,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:03,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:03,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:03,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:03,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:03,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:03,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:03,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:03,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:03,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:03,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:03,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:03,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:03,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:03,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:03,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:03,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:03,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:03,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:03,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:03,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:03,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:03,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:03,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:03,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:03,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:03,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:03,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:03,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:03,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:03,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:03,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:03,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:03,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:03,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:03,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:03:03,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:03,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:03,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:03,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:03,466 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:03,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:03,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:03,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:03,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:03,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:03,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:03:03,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:03:03,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:03:03,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:03,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:03,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:03,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:03:03,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:03,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:03,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:03:03,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:03:03,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:03:03,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:03,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:03:03,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:03:03,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:03,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:03:03,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:03:03,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer 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 -> Automizer 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 -> 41b53a8be36a107d9ce8e745364368cfe44e748b [2019-11-16 00:03:03,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:03,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:03,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:03,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:03,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:03,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-11-16 00:03:03,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/data/a18828a51/393feab9897a42a3a1fcb9864d37ccdc/FLAG9a667f2d9 [2019-11-16 00:03:03,986 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:03,987 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-11-16 00:03:03,999 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/data/a18828a51/393feab9897a42a3a1fcb9864d37ccdc/FLAG9a667f2d9 [2019-11-16 00:03:04,320 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/data/a18828a51/393feab9897a42a3a1fcb9864d37ccdc [2019-11-16 00:03:04,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:04,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:04,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:04,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:04,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:04,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81bc6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04, skipping insertion in model container [2019-11-16 00:03:04,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,343 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:04,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:04,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:04,719 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:04,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:04,828 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:04,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04 WrapperNode [2019-11-16 00:03:04,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:04,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:04,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:04,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:04,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:04,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:04,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:04,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:04,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2019-11-16 00:03:04,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:04,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:04,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:04,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:04,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/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 [2019-11-16 00:03:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:05,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:05,257 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:03:06,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-16 00:03:06,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-16 00:03:06,102 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:06,102 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:03:06,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:06 BoogieIcfgContainer [2019-11-16 00:03:06,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:06,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:03:06,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:03:06,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:03:06,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:04" (1/3) ... [2019-11-16 00:03:06,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aae11b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:06, skipping insertion in model container [2019-11-16 00:03:06,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (2/3) ... [2019-11-16 00:03:06,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aae11b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:06, skipping insertion in model container [2019-11-16 00:03:06,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:06" (3/3) ... [2019-11-16 00:03:06,112 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-11-16 00:03:06,122 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:03:06,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:03:06,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:03:06,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:03:06,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:03:06,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:03:06,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:06,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:06,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:03:06,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:06,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:03:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-16 00:03:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:03:06,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:06,198 INFO L380 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] [2019-11-16 00:03:06,200 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2019-11-16 00:03:06,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:06,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751650654] [2019-11-16 00:03:06,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:06,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751650654] [2019-11-16 00:03:06,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:06,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:06,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857142671] [2019-11-16 00:03:06,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:06,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:06,467 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-16 00:03:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:06,840 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2019-11-16 00:03:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:06,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-16 00:03:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:06,868 INFO L225 Difference]: With dead ends: 338 [2019-11-16 00:03:06,868 INFO L226 Difference]: Without dead ends: 179 [2019-11-16 00:03:06,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-16 00:03:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2019-11-16 00:03:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-16 00:03:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2019-11-16 00:03:06,927 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2019-11-16 00:03:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:06,928 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2019-11-16 00:03:06,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2019-11-16 00:03:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:03:06,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:06,934 INFO L380 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] [2019-11-16 00:03:06,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2019-11-16 00:03:06,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:06,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750952126] [2019-11-16 00:03:06,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:07,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750952126] [2019-11-16 00:03:07,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:07,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:07,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497094868] [2019-11-16 00:03:07,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:07,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:07,022 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2019-11-16 00:03:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:07,312 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2019-11-16 00:03:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:07,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-16 00:03:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:07,316 INFO L225 Difference]: With dead ends: 382 [2019-11-16 00:03:07,316 INFO L226 Difference]: Without dead ends: 218 [2019-11-16 00:03:07,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-16 00:03:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-11-16 00:03:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-16 00:03:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-16 00:03:07,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2019-11-16 00:03:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:07,340 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-16 00:03:07,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-16 00:03:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:03:07,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:07,345 INFO L380 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] [2019-11-16 00:03:07,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2019-11-16 00:03:07,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:07,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229153966] [2019-11-16 00:03:07,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:07,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229153966] [2019-11-16 00:03:07,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:07,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:07,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024154643] [2019-11-16 00:03:07,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:07,465 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-16 00:03:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:07,678 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-16 00:03:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:07,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:03:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:07,682 INFO L225 Difference]: With dead ends: 444 [2019-11-16 00:03:07,682 INFO L226 Difference]: Without dead ends: 241 [2019-11-16 00:03:07,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-16 00:03:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-16 00:03:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-16 00:03:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-16 00:03:07,719 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2019-11-16 00:03:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:07,720 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-16 00:03:07,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-16 00:03:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:03:07,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:07,733 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:07,733 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2019-11-16 00:03:07,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:07,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684378019] [2019-11-16 00:03:07,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:07,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684378019] [2019-11-16 00:03:07,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:07,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:07,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047708234] [2019-11-16 00:03:07,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:07,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:07,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:07,838 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-16 00:03:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,096 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2019-11-16 00:03:08,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:08,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-16 00:03:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,099 INFO L225 Difference]: With dead ends: 513 [2019-11-16 00:03:08,099 INFO L226 Difference]: Without dead ends: 279 [2019-11-16 00:03:08,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-16 00:03:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-11-16 00:03:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:03:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2019-11-16 00:03:08,117 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2019-11-16 00:03:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2019-11-16 00:03:08,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2019-11-16 00:03:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:03:08,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,119 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:08,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2019-11-16 00:03:08,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720881976] [2019-11-16 00:03:08,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:08,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720881976] [2019-11-16 00:03:08,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:08,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937497335] [2019-11-16 00:03:08,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:08,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,186 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2019-11-16 00:03:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,402 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2019-11-16 00:03:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:08,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-16 00:03:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,405 INFO L225 Difference]: With dead ends: 549 [2019-11-16 00:03:08,405 INFO L226 Difference]: Without dead ends: 279 [2019-11-16 00:03:08,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-16 00:03:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-11-16 00:03:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:03:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2019-11-16 00:03:08,426 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2019-11-16 00:03:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,426 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2019-11-16 00:03:08,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2019-11-16 00:03:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:03:08,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,428 INFO L380 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] [2019-11-16 00:03:08,429 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2019-11-16 00:03:08,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213961787] [2019-11-16 00:03:08,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:08,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213961787] [2019-11-16 00:03:08,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:08,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840254861] [2019-11-16 00:03:08,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:08,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,513 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2019-11-16 00:03:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,672 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2019-11-16 00:03:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:08,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-16 00:03:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,674 INFO L225 Difference]: With dead ends: 564 [2019-11-16 00:03:08,674 INFO L226 Difference]: Without dead ends: 294 [2019-11-16 00:03:08,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-16 00:03:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-11-16 00:03:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-16 00:03:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-11-16 00:03:08,688 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2019-11-16 00:03:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,689 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-11-16 00:03:08,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-11-16 00:03:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:03:08,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,700 INFO L380 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] [2019-11-16 00:03:08,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2019-11-16 00:03:08,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215249888] [2019-11-16 00:03:08,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:08,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215249888] [2019-11-16 00:03:08,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:08,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552234260] [2019-11-16 00:03:08,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:08,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,756 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2019-11-16 00:03:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,886 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2019-11-16 00:03:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:08,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-16 00:03:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,888 INFO L225 Difference]: With dead ends: 579 [2019-11-16 00:03:08,889 INFO L226 Difference]: Without dead ends: 294 [2019-11-16 00:03:08,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-16 00:03:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-11-16 00:03:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-16 00:03:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2019-11-16 00:03:08,900 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2019-11-16 00:03:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,900 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2019-11-16 00:03:08,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2019-11-16 00:03:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:03:08,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,902 INFO L380 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] [2019-11-16 00:03:08,902 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2019-11-16 00:03:08,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-16 00:03:08,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-16 00:03:08,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-16 00:03:08,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:08,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940647112] [2019-11-16 00:03:08,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:08,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:08,952 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2019-11-16 00:03:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,071 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2019-11-16 00:03:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:09,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-16 00:03:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,074 INFO L225 Difference]: With dead ends: 586 [2019-11-16 00:03:09,075 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:03:09,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:03:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-11-16 00:03:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-16 00:03:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2019-11-16 00:03:09,086 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2019-11-16 00:03:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,086 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2019-11-16 00:03:09,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2019-11-16 00:03:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:03:09,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,090 INFO L380 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] [2019-11-16 00:03:09,090 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2019-11-16 00:03:09,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887155673] [2019-11-16 00:03:09,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:09,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887155673] [2019-11-16 00:03:09,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:09,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101996749] [2019-11-16 00:03:09,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:09,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,151 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2019-11-16 00:03:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,311 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2019-11-16 00:03:09,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:09,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-16 00:03:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,315 INFO L225 Difference]: With dead ends: 626 [2019-11-16 00:03:09,315 INFO L226 Difference]: Without dead ends: 332 [2019-11-16 00:03:09,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-16 00:03:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-11-16 00:03:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-16 00:03:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2019-11-16 00:03:09,332 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2019-11-16 00:03:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,333 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2019-11-16 00:03:09,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2019-11-16 00:03:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:03:09,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,337 INFO L380 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] [2019-11-16 00:03:09,337 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2019-11-16 00:03:09,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477786034] [2019-11-16 00:03:09,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:09,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477786034] [2019-11-16 00:03:09,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:09,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905450304] [2019-11-16 00:03:09,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:09,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:09,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,380 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2019-11-16 00:03:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,541 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2019-11-16 00:03:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:09,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-16 00:03:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,544 INFO L225 Difference]: With dead ends: 655 [2019-11-16 00:03:09,544 INFO L226 Difference]: Without dead ends: 332 [2019-11-16 00:03:09,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-16 00:03:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-11-16 00:03:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-16 00:03:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2019-11-16 00:03:09,557 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2019-11-16 00:03:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,558 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2019-11-16 00:03:09,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2019-11-16 00:03:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:03:09,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,560 INFO L380 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] [2019-11-16 00:03:09,560 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2019-11-16 00:03:09,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760251683] [2019-11-16 00:03:09,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:09,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760251683] [2019-11-16 00:03:09,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:09,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555575081] [2019-11-16 00:03:09,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:09,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,607 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2019-11-16 00:03:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,771 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2019-11-16 00:03:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:09,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-16 00:03:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,774 INFO L225 Difference]: With dead ends: 688 [2019-11-16 00:03:09,774 INFO L226 Difference]: Without dead ends: 365 [2019-11-16 00:03:09,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-16 00:03:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-11-16 00:03:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-16 00:03:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2019-11-16 00:03:09,789 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2019-11-16 00:03:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,789 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2019-11-16 00:03:09,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2019-11-16 00:03:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:03:09,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,791 INFO L380 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] [2019-11-16 00:03:09,791 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2019-11-16 00:03:09,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477065190] [2019-11-16 00:03:09,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:09,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477065190] [2019-11-16 00:03:09,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:09,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758109367] [2019-11-16 00:03:09,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:09,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:09,838 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2019-11-16 00:03:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,018 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2019-11-16 00:03:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:10,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:03:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,021 INFO L225 Difference]: With dead ends: 715 [2019-11-16 00:03:10,021 INFO L226 Difference]: Without dead ends: 365 [2019-11-16 00:03:10,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-16 00:03:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-11-16 00:03:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-16 00:03:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2019-11-16 00:03:10,037 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2019-11-16 00:03:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,037 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2019-11-16 00:03:10,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2019-11-16 00:03:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:03:10,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,039 INFO L380 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, 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] [2019-11-16 00:03:10,039 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2019-11-16 00:03:10,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576022124] [2019-11-16 00:03:10,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-16 00:03:10,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576022124] [2019-11-16 00:03:10,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:10,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558420964] [2019-11-16 00:03:10,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:10,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,091 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2019-11-16 00:03:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,291 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2019-11-16 00:03:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:10,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-16 00:03:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,295 INFO L225 Difference]: With dead ends: 743 [2019-11-16 00:03:10,295 INFO L226 Difference]: Without dead ends: 393 [2019-11-16 00:03:10,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-16 00:03:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-11-16 00:03:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-16 00:03:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2019-11-16 00:03:10,314 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2019-11-16 00:03:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,314 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2019-11-16 00:03:10,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2019-11-16 00:03:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-16 00:03:10,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,317 INFO L380 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, 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] [2019-11-16 00:03:10,317 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2019-11-16 00:03:10,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387582688] [2019-11-16 00:03:10,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-16 00:03:10,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387582688] [2019-11-16 00:03:10,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:10,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695117927] [2019-11-16 00:03:10,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:10,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,367 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2019-11-16 00:03:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,566 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2019-11-16 00:03:10,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:10,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-16 00:03:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,570 INFO L225 Difference]: With dead ends: 777 [2019-11-16 00:03:10,570 INFO L226 Difference]: Without dead ends: 393 [2019-11-16 00:03:10,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-16 00:03:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-11-16 00:03:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-16 00:03:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2019-11-16 00:03:10,588 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2019-11-16 00:03:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,589 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2019-11-16 00:03:10,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2019-11-16 00:03:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-16 00:03:10,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,591 INFO L380 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:10,592 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2019-11-16 00:03:10,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694079565] [2019-11-16 00:03:10,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:10,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694079565] [2019-11-16 00:03:10,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:10,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942453347] [2019-11-16 00:03:10,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:10,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,636 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2019-11-16 00:03:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,855 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2019-11-16 00:03:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:10,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-16 00:03:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,858 INFO L225 Difference]: With dead ends: 822 [2019-11-16 00:03:10,859 INFO L226 Difference]: Without dead ends: 438 [2019-11-16 00:03:10,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-16 00:03:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2019-11-16 00:03:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-16 00:03:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2019-11-16 00:03:10,880 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2019-11-16 00:03:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,880 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2019-11-16 00:03:10,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2019-11-16 00:03:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:03:10,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,883 INFO L380 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:10,883 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2019-11-16 00:03:10,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493604143] [2019-11-16 00:03:10,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:03:10,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493604143] [2019-11-16 00:03:10,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:10,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535521862] [2019-11-16 00:03:10,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:10,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:10,950 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2019-11-16 00:03:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,194 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2019-11-16 00:03:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:11,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-16 00:03:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,198 INFO L225 Difference]: With dead ends: 868 [2019-11-16 00:03:11,198 INFO L226 Difference]: Without dead ends: 440 [2019-11-16 00:03:11,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-16 00:03:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-11-16 00:03:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-16 00:03:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2019-11-16 00:03:11,218 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2019-11-16 00:03:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:11,218 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2019-11-16 00:03:11,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2019-11-16 00:03:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-16 00:03:11,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:11,222 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-11-16 00:03:11,222 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2019-11-16 00:03:11,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:11,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496181446] [2019-11-16 00:03:11,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-16 00:03:11,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496181446] [2019-11-16 00:03:11,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:11,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9986465] [2019-11-16 00:03:11,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:11,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:11,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,266 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2019-11-16 00:03:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,423 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2019-11-16 00:03:11,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:11,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-16 00:03:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,427 INFO L225 Difference]: With dead ends: 901 [2019-11-16 00:03:11,427 INFO L226 Difference]: Without dead ends: 473 [2019-11-16 00:03:11,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-16 00:03:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-11-16 00:03:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-16 00:03:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2019-11-16 00:03:11,451 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2019-11-16 00:03:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:11,451 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2019-11-16 00:03:11,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2019-11-16 00:03:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-16 00:03:11,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:11,454 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-11-16 00:03:11,454 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2019-11-16 00:03:11,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:11,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420474043] [2019-11-16 00:03:11,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-16 00:03:11,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420474043] [2019-11-16 00:03:11,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:11,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864501153] [2019-11-16 00:03:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:11,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,499 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2019-11-16 00:03:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,673 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2019-11-16 00:03:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:11,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-16 00:03:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,677 INFO L225 Difference]: With dead ends: 926 [2019-11-16 00:03:11,677 INFO L226 Difference]: Without dead ends: 473 [2019-11-16 00:03:11,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-16 00:03:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-11-16 00:03:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-16 00:03:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2019-11-16 00:03:11,697 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2019-11-16 00:03:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:11,697 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2019-11-16 00:03:11,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2019-11-16 00:03:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-16 00:03:11,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:11,700 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:11,700 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2019-11-16 00:03:11,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:11,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141897055] [2019-11-16 00:03:11,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-16 00:03:11,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141897055] [2019-11-16 00:03:11,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:11,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941981367] [2019-11-16 00:03:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:11,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,740 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2019-11-16 00:03:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,896 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2019-11-16 00:03:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:11,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-16 00:03:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,899 INFO L225 Difference]: With dead ends: 917 [2019-11-16 00:03:11,899 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:03:11,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:03:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-11-16 00:03:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-16 00:03:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2019-11-16 00:03:11,918 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2019-11-16 00:03:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:11,919 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2019-11-16 00:03:11,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2019-11-16 00:03:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-16 00:03:11,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:11,921 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:11,922 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2019-11-16 00:03:11,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:11,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477641652] [2019-11-16 00:03:11,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-16 00:03:11,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477641652] [2019-11-16 00:03:11,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:11,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904651062] [2019-11-16 00:03:11,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:11,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:11,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:11,967 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2019-11-16 00:03:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,156 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2019-11-16 00:03:12,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:12,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-16 00:03:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,160 INFO L225 Difference]: With dead ends: 917 [2019-11-16 00:03:12,160 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:03:12,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:03:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-11-16 00:03:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-16 00:03:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2019-11-16 00:03:12,185 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2019-11-16 00:03:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,185 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2019-11-16 00:03:12,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2019-11-16 00:03:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:03:12,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,189 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:12,189 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2019-11-16 00:03:12,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021092597] [2019-11-16 00:03:12,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-16 00:03:12,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021092597] [2019-11-16 00:03:12,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:12,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394130833] [2019-11-16 00:03:12,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:12,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:12,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,254 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2019-11-16 00:03:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,456 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2019-11-16 00:03:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:12,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-16 00:03:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,460 INFO L225 Difference]: With dead ends: 941 [2019-11-16 00:03:12,460 INFO L226 Difference]: Without dead ends: 488 [2019-11-16 00:03:12,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-16 00:03:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-11-16 00:03:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-16 00:03:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2019-11-16 00:03:12,481 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2019-11-16 00:03:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,482 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2019-11-16 00:03:12,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2019-11-16 00:03:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:03:12,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,485 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:12,485 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2019-11-16 00:03:12,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-11-16 00:03:12,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-16 00:03:12,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-11-16 00:03:12,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:12,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017673641] [2019-11-16 00:03:12,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:12,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,532 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2019-11-16 00:03:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,697 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2019-11-16 00:03:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:12,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-16 00:03:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,700 INFO L225 Difference]: With dead ends: 965 [2019-11-16 00:03:12,700 INFO L226 Difference]: Without dead ends: 488 [2019-11-16 00:03:12,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-16 00:03:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-11-16 00:03:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-16 00:03:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2019-11-16 00:03:12,718 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2019-11-16 00:03:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,718 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2019-11-16 00:03:12,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2019-11-16 00:03:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-16 00:03:12,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,720 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:12,721 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,721 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2019-11-16 00:03:12,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342758319] [2019-11-16 00:03:12,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-16 00:03:12,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342758319] [2019-11-16 00:03:12,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:12,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646720661] [2019-11-16 00:03:12,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:12,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,763 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2019-11-16 00:03:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,927 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2019-11-16 00:03:12,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:12,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-16 00:03:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,931 INFO L225 Difference]: With dead ends: 1008 [2019-11-16 00:03:12,931 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:03:12,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:03:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-11-16 00:03:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-16 00:03:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2019-11-16 00:03:12,949 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2019-11-16 00:03:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,950 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2019-11-16 00:03:12,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2019-11-16 00:03:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:03:12,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,952 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:03:12,952 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2019-11-16 00:03:12,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640905153] [2019-11-16 00:03:12,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-16 00:03:12,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640905153] [2019-11-16 00:03:12,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:12,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285792905] [2019-11-16 00:03:12,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:12,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:12,996 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2019-11-16 00:03:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,149 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2019-11-16 00:03:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:13,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-16 00:03:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,152 INFO L225 Difference]: With dead ends: 1049 [2019-11-16 00:03:13,152 INFO L226 Difference]: Without dead ends: 512 [2019-11-16 00:03:13,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-16 00:03:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2019-11-16 00:03:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-16 00:03:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2019-11-16 00:03:13,171 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2019-11-16 00:03:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,172 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2019-11-16 00:03:13,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2019-11-16 00:03:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:03:13,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,174 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:13,174 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2019-11-16 00:03:13,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795717745] [2019-11-16 00:03:13,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-16 00:03:13,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795717745] [2019-11-16 00:03:13,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:13,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:13,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814075782] [2019-11-16 00:03:13,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:13,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:13,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:13,216 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2019-11-16 00:03:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,347 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2019-11-16 00:03:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:13,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-16 00:03:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,351 INFO L225 Difference]: With dead ends: 1030 [2019-11-16 00:03:13,351 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:03:13,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:03:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2019-11-16 00:03:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-16 00:03:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2019-11-16 00:03:13,372 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2019-11-16 00:03:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,372 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2019-11-16 00:03:13,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2019-11-16 00:03:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:03:13,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,374 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:13,375 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2019-11-16 00:03:13,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598721634] [2019-11-16 00:03:13,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-16 00:03:13,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598721634] [2019-11-16 00:03:13,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:13,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:03:13,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209926752] [2019-11-16 00:03:13,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:13,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:13,418 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2019-11-16 00:03:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,550 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2019-11-16 00:03:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:13,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:03:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,554 INFO L225 Difference]: With dead ends: 1051 [2019-11-16 00:03:13,554 INFO L226 Difference]: Without dead ends: 529 [2019-11-16 00:03:13,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-11-16 00:03:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-11-16 00:03:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-16 00:03:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2019-11-16 00:03:13,574 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2019-11-16 00:03:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,574 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2019-11-16 00:03:13,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2019-11-16 00:03:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:03:13,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,577 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:13,577 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2019-11-16 00:03:13,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166616568] [2019-11-16 00:03:13,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-16 00:03:13,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166616568] [2019-11-16 00:03:13,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337509737] [2019-11-16 00:03:13,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:13,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-16 00:03:13,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:13,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:13,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649241219] [2019-11-16 00:03:13,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:13,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:13,888 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 3 states. [2019-11-16 00:03:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,990 INFO L93 Difference]: Finished difference Result 1559 states and 2275 transitions. [2019-11-16 00:03:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:13,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-16 00:03:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,997 INFO L225 Difference]: With dead ends: 1559 [2019-11-16 00:03:13,997 INFO L226 Difference]: Without dead ends: 1041 [2019-11-16 00:03:13,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-16 00:03:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-11-16 00:03:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-11-16 00:03:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1512 transitions. [2019-11-16 00:03:14,049 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1512 transitions. Word has length 181 [2019-11-16 00:03:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:14,050 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 1512 transitions. [2019-11-16 00:03:14,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1512 transitions. [2019-11-16 00:03:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:03:14,053 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:14,054 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:14,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:14,259 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2019-11-16 00:03:14,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:14,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368502455] [2019-11-16 00:03:14,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-16 00:03:14,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368502455] [2019-11-16 00:03:14,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:14,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:14,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376371607] [2019-11-16 00:03:14,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:14,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:14,341 INFO L87 Difference]: Start difference. First operand 1041 states and 1512 transitions. Second operand 3 states. [2019-11-16 00:03:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:14,443 INFO L93 Difference]: Finished difference Result 2585 states and 3758 transitions. [2019-11-16 00:03:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:14,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-16 00:03:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:14,453 INFO L225 Difference]: With dead ends: 2585 [2019-11-16 00:03:14,453 INFO L226 Difference]: Without dead ends: 1551 [2019-11-16 00:03:14,455 INFO L600 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 [2019-11-16 00:03:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-11-16 00:03:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2019-11-16 00:03:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-11-16 00:03:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2248 transitions. [2019-11-16 00:03:14,516 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2248 transitions. Word has length 188 [2019-11-16 00:03:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:14,517 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 2248 transitions. [2019-11-16 00:03:14,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2248 transitions. [2019-11-16 00:03:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:03:14,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:14,522 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:14,522 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2019-11-16 00:03:14,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:14,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723892724] [2019-11-16 00:03:14,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-16 00:03:14,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723892724] [2019-11-16 00:03:14,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:14,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:14,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434791773] [2019-11-16 00:03:14,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:14,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:14,602 INFO L87 Difference]: Start difference. First operand 1551 states and 2248 transitions. Second operand 3 states. [2019-11-16 00:03:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:14,740 INFO L93 Difference]: Finished difference Result 3606 states and 5231 transitions. [2019-11-16 00:03:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:14,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-16 00:03:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:14,753 INFO L225 Difference]: With dead ends: 3606 [2019-11-16 00:03:14,754 INFO L226 Difference]: Without dead ends: 2062 [2019-11-16 00:03:14,757 INFO L600 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 [2019-11-16 00:03:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-11-16 00:03:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-11-16 00:03:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-11-16 00:03:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2985 transitions. [2019-11-16 00:03:14,847 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2985 transitions. Word has length 189 [2019-11-16 00:03:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:14,848 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 2985 transitions. [2019-11-16 00:03:14,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2985 transitions. [2019-11-16 00:03:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-16 00:03:14,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:14,858 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-16 00:03:14,858 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2019-11-16 00:03:14,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:14,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994879482] [2019-11-16 00:03:14,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:14,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-16 00:03:15,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994879482] [2019-11-16 00:03:15,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:15,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:15,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017012794] [2019-11-16 00:03:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:15,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:15,037 INFO L87 Difference]: Start difference. First operand 2062 states and 2985 transitions. Second operand 3 states. [2019-11-16 00:03:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:15,178 INFO L93 Difference]: Finished difference Result 5692 states and 8229 transitions. [2019-11-16 00:03:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:15,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-11-16 00:03:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:15,198 INFO L225 Difference]: With dead ends: 5692 [2019-11-16 00:03:15,199 INFO L226 Difference]: Without dead ends: 3637 [2019-11-16 00:03:15,202 INFO L600 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 [2019-11-16 00:03:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-11-16 00:03:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2019-11-16 00:03:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-11-16 00:03:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5245 transitions. [2019-11-16 00:03:15,461 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5245 transitions. Word has length 338 [2019-11-16 00:03:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:15,461 INFO L462 AbstractCegarLoop]: Abstraction has 3635 states and 5245 transitions. [2019-11-16 00:03:15,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5245 transitions. [2019-11-16 00:03:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-16 00:03:15,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:15,476 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:15,476 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2019-11-16 00:03:15,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:15,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114024235] [2019-11-16 00:03:15,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:15,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:15,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-16 00:03:15,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114024235] [2019-11-16 00:03:15,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:15,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:15,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147403226] [2019-11-16 00:03:15,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:15,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:15,632 INFO L87 Difference]: Start difference. First operand 3635 states and 5245 transitions. Second operand 3 states. [2019-11-16 00:03:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:15,946 INFO L93 Difference]: Finished difference Result 7423 states and 10735 transitions. [2019-11-16 00:03:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:15,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-16 00:03:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:15,963 INFO L225 Difference]: With dead ends: 7423 [2019-11-16 00:03:15,963 INFO L226 Difference]: Without dead ends: 2498 [2019-11-16 00:03:15,971 INFO L600 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 [2019-11-16 00:03:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-11-16 00:03:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2019-11-16 00:03:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-16 00:03:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3552 transitions. [2019-11-16 00:03:16,089 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3552 transitions. Word has length 375 [2019-11-16 00:03:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:16,089 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3552 transitions. [2019-11-16 00:03:16,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3552 transitions. [2019-11-16 00:03:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-16 00:03:16,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:16,106 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:16,106 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 943000906, now seen corresponding path program 1 times [2019-11-16 00:03:16,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:16,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216339355] [2019-11-16 00:03:16,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:16,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:16,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-16 00:03:16,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216339355] [2019-11-16 00:03:16,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086315196] [2019-11-16 00:03:16,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:16,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-11-16 00:03:16,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:16,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:16,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308141837] [2019-11-16 00:03:16,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:16,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:16,806 INFO L87 Difference]: Start difference. First operand 2498 states and 3552 transitions. Second operand 3 states. [2019-11-16 00:03:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:16,877 INFO L93 Difference]: Finished difference Result 2558 states and 3638 transitions. [2019-11-16 00:03:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:16,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-11-16 00:03:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:16,892 INFO L225 Difference]: With dead ends: 2558 [2019-11-16 00:03:16,892 INFO L226 Difference]: Without dead ends: 2069 [2019-11-16 00:03:16,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-16 00:03:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2011. [2019-11-16 00:03:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-11-16 00:03:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2860 transitions. [2019-11-16 00:03:16,985 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2860 transitions. Word has length 441 [2019-11-16 00:03:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:16,986 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 2860 transitions. [2019-11-16 00:03:16,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2860 transitions. [2019-11-16 00:03:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-16 00:03:16,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:17,000 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:17,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:17,201 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1896941064, now seen corresponding path program 1 times [2019-11-16 00:03:17,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:17,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168966786] [2019-11-16 00:03:17,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:17,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:17,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-16 00:03:17,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168966786] [2019-11-16 00:03:17,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994794139] [2019-11-16 00:03:17,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-11-16 00:03:17,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:17,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:17,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101121116] [2019-11-16 00:03:17,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:17,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:17,826 INFO L87 Difference]: Start difference. First operand 2011 states and 2860 transitions. Second operand 3 states. [2019-11-16 00:03:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:17,937 INFO L93 Difference]: Finished difference Result 4484 states and 6387 transitions. [2019-11-16 00:03:17,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:17,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-11-16 00:03:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:17,971 INFO L225 Difference]: With dead ends: 4484 [2019-11-16 00:03:17,971 INFO L226 Difference]: Without dead ends: 2480 [2019-11-16 00:03:17,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-16 00:03:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2019-11-16 00:03:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-11-16 00:03:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3528 transitions. [2019-11-16 00:03:18,080 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3528 transitions. Word has length 441 [2019-11-16 00:03:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:18,081 INFO L462 AbstractCegarLoop]: Abstraction has 2480 states and 3528 transitions. [2019-11-16 00:03:18,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3528 transitions. [2019-11-16 00:03:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-11-16 00:03:18,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:18,095 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:18,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:18,299 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -699120285, now seen corresponding path program 1 times [2019-11-16 00:03:18,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:18,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251741415] [2019-11-16 00:03:18,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:18,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:18,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-16 00:03:18,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251741415] [2019-11-16 00:03:18,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450344349] [2019-11-16 00:03:18,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:18,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-11-16 00:03:18,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:18,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:18,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628186458] [2019-11-16 00:03:18,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:18,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:18,816 INFO L87 Difference]: Start difference. First operand 2480 states and 3528 transitions. Second operand 3 states. [2019-11-16 00:03:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:18,990 INFO L93 Difference]: Finished difference Result 5462 states and 7775 transitions. [2019-11-16 00:03:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:18,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-11-16 00:03:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:18,998 INFO L225 Difference]: With dead ends: 5462 [2019-11-16 00:03:18,998 INFO L226 Difference]: Without dead ends: 2989 [2019-11-16 00:03:19,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-11-16 00:03:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2019-11-16 00:03:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-11-16 00:03:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4248 transitions. [2019-11-16 00:03:19,110 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4248 transitions. Word has length 442 [2019-11-16 00:03:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:19,111 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 4248 transitions. [2019-11-16 00:03:19,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4248 transitions. [2019-11-16 00:03:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-16 00:03:19,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:19,124 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:19,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:19,328 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -517858284, now seen corresponding path program 1 times [2019-11-16 00:03:19,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:19,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166479655] [2019-11-16 00:03:19,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:19,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:19,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-16 00:03:19,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166479655] [2019-11-16 00:03:19,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470133785] [2019-11-16 00:03:19,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:19,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-11-16 00:03:19,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:19,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:19,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893718662] [2019-11-16 00:03:19,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:19,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:19,778 INFO L87 Difference]: Start difference. First operand 2989 states and 4248 transitions. Second operand 3 states. [2019-11-16 00:03:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:19,930 INFO L93 Difference]: Finished difference Result 6439 states and 9162 transitions. [2019-11-16 00:03:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:19,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-16 00:03:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:19,938 INFO L225 Difference]: With dead ends: 6439 [2019-11-16 00:03:19,939 INFO L226 Difference]: Without dead ends: 3457 [2019-11-16 00:03:19,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-11-16 00:03:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3457. [2019-11-16 00:03:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-11-16 00:03:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4915 transitions. [2019-11-16 00:03:20,080 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4915 transitions. Word has length 443 [2019-11-16 00:03:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:20,081 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 4915 transitions. [2019-11-16 00:03:20,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4915 transitions. [2019-11-16 00:03:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-16 00:03:20,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:20,099 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:20,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:20,304 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1394872725, now seen corresponding path program 1 times [2019-11-16 00:03:20,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:20,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933350092] [2019-11-16 00:03:20,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:20,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:20,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-16 00:03:20,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933350092] [2019-11-16 00:03:20,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306600861] [2019-11-16 00:03:20,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:20,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:20,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-16 00:03:21,202 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:21,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:03:21,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728181117] [2019-11-16 00:03:21,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:21,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:21,204 INFO L87 Difference]: Start difference. First operand 3457 states and 4915 transitions. Second operand 4 states. [2019-11-16 00:03:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:21,519 INFO L93 Difference]: Finished difference Result 6879 states and 9779 transitions. [2019-11-16 00:03:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:21,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 594 [2019-11-16 00:03:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:21,526 INFO L225 Difference]: With dead ends: 6879 [2019-11-16 00:03:21,527 INFO L226 Difference]: Without dead ends: 3352 [2019-11-16 00:03:21,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-11-16 00:03:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3092. [2019-11-16 00:03:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-11-16 00:03:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-11-16 00:03:21,631 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 594 [2019-11-16 00:03:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:21,632 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-11-16 00:03:21,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-11-16 00:03:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-16 00:03:21,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:21,647 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:21,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:21,851 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1182493111, now seen corresponding path program 1 times [2019-11-16 00:03:21,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:21,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715917257] [2019-11-16 00:03:21,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:21,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-16 00:03:22,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715917257] [2019-11-16 00:03:22,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866039253] [2019-11-16 00:03:22,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:03:22,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-16 00:03:23,529 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:23,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:03:23,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081936599] [2019-11-16 00:03:23,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:23,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:23,532 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 4 states. [2019-11-16 00:03:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:23,914 INFO L93 Difference]: Finished difference Result 7201 states and 9931 transitions. [2019-11-16 00:03:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:23,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1014 [2019-11-16 00:03:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:23,924 INFO L225 Difference]: With dead ends: 7201 [2019-11-16 00:03:23,924 INFO L226 Difference]: Without dead ends: 3932 [2019-11-16 00:03:23,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-11-16 00:03:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3092. [2019-11-16 00:03:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-11-16 00:03:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-11-16 00:03:24,040 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 1014 [2019-11-16 00:03:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:24,041 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-11-16 00:03:24,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-11-16 00:03:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-11-16 00:03:24,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:24,061 INFO L380 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:03:24,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:24,267 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:24,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:24,268 INFO L82 PathProgramCache]: Analyzing trace with hash 283829187, now seen corresponding path program 1 times [2019-11-16 00:03:24,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:24,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967553125] [2019-11-16 00:03:24,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:24,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:24,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-11-16 00:03:25,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967553125] [2019-11-16 00:03:25,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:25,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:25,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251333438] [2019-11-16 00:03:25,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:25,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:25,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:25,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:25,349 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 3 states. [2019-11-16 00:03:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:25,597 INFO L93 Difference]: Finished difference Result 6327 states and 8667 transitions. [2019-11-16 00:03:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:25,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-11-16 00:03:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:25,605 INFO L225 Difference]: With dead ends: 6327 [2019-11-16 00:03:25,605 INFO L226 Difference]: Without dead ends: 3218 [2019-11-16 00:03:25,610 INFO L600 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 [2019-11-16 00:03:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-11-16 00:03:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3148. [2019-11-16 00:03:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-11-16 00:03:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4298 transitions. [2019-11-16 00:03:25,728 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4298 transitions. Word has length 1264 [2019-11-16 00:03:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:25,729 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4298 transitions. [2019-11-16 00:03:25,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4298 transitions. [2019-11-16 00:03:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-11-16 00:03:25,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:25,757 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:25,758 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:25,758 INFO L82 PathProgramCache]: Analyzing trace with hash 515038815, now seen corresponding path program 1 times [2019-11-16 00:03:25,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:25,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881249776] [2019-11-16 00:03:25,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:25,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:25,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-11-16 00:03:26,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881249776] [2019-11-16 00:03:26,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:26,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:26,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306899796] [2019-11-16 00:03:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:26,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:26,797 INFO L87 Difference]: Start difference. First operand 3148 states and 4298 transitions. Second operand 3 states. [2019-11-16 00:03:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:26,965 INFO L93 Difference]: Finished difference Result 4148 states and 5651 transitions. [2019-11-16 00:03:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:26,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1294 [2019-11-16 00:03:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:26,966 INFO L225 Difference]: With dead ends: 4148 [2019-11-16 00:03:26,966 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:03:26,970 INFO L600 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 [2019-11-16 00:03:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:03:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:03:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:03:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:03:26,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1294 [2019-11-16 00:03:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:26,971 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:03:26,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:03:26,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:03:26,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:03:27,633 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-11-16 00:03:28,174 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-11-16 00:03:29,095 WARN L191 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-16 00:03:29,311 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-16 00:03:30,304 WARN L191 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-16 00:03:31,126 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:32,166 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-11-16 00:03:32,941 WARN L191 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-16 00:03:33,636 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-11-16 00:03:34,426 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-11-16 00:03:34,905 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-11-16 00:03:35,467 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:35,943 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-16 00:03:36,331 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:03:36,960 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2019-11-16 00:03:37,667 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:37,992 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-16 00:03:38,576 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:39,557 WARN L191 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-11-16 00:03:40,035 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:40,497 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-16 00:03:40,764 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-16 00:03:41,429 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-11-16 00:03:41,431 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 501) no Hoare annotation was computed. [2019-11-16 00:03:41,432 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-16 00:03:41,432 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-16 00:03:41,432 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-16 00:03:41,432 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 569) the Hoare annotation is: (let ((.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse28 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) [2019-11-16 00:03:41,433 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 601) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-11-16 00:03:41,433 INFO L446 ceAbstractionStarter]: At program point L631(lines 10 633) the Hoare annotation is: true [2019-11-16 00:03:41,433 INFO L439 ceAbstractionStarter]: At program point L565(lines 98 620) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse19 (not .cse20)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse12 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse4 .cse13 .cse5 .cse6 .cse14 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse17 .cse18 .cse7 .cse8 .cse9 .cse10 .cse19) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21) (and .cse22 .cse19) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse19) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)))))) [2019-11-16 00:03:41,433 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L533-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 567) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 578) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 589) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 600) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L443 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-16 00:03:41,434 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-16 00:03:41,434 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 579) the Hoare annotation is: (let ((.cse11 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse29 (not .cse11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse0 .cse2 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse26 .cse27 .cse10 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse18 .cse19 .cse20 .cse0 .cse2 .cse3 .cse4 .cse21 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse26 .cse27 .cse10 .cse28 .cse13 .cse14 .cse16 .cse29)))) [2019-11-16 00:03:41,435 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 590) the Hoare annotation is: (let ((.cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse23 .cse27 .cse24) (and .cse26 (and (and .cse28 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse21 .cse23 .cse24) .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 618) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 513) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L439 ceAbstractionStarter]: At program point L206(lines 205 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 577) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 588) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 599) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 617) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L273-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,435 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 603 617) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 512) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 576) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 587) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 598) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 608) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 484) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-16 00:03:41,436 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-16 00:03:41,437 INFO L439 ceAbstractionStarter]: At program point L210(lines 104 600) the Hoare annotation is: (let ((.cse27 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse20 .cse22 .cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse24) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24))) [2019-11-16 00:03:41,437 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 577) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-11-16 00:03:41,438 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 588) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not .cse28)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse26 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19 .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse19 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23)))) [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 546) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 511) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L542-2(lines 542 546) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L509-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 575) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 586) no Hoare annotation was computed. [2019-11-16 00:03:41,438 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 597) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 483) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L477-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L446 ceAbstractionStarter]: At program point L643(lines 634 645) the Hoare annotation is: true [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L611(lines 611 615) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 574) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 585) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-16 00:03:41,439 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 596) no Hoare annotation was computed. [2019-11-16 00:03:41,440 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 482) no Hoare annotation was computed. [2019-11-16 00:03:41,440 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 575) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2019-11-16 00:03:41,440 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 586) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28) (and .cse1 (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28)))) [2019-11-16 00:03:41,440 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-16 00:03:41,441 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-16 00:03:41,441 INFO L439 ceAbstractionStarter]: At program point L481(lines 71 632) the Hoare annotation is: false [2019-11-16 00:03:41,441 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-16 00:03:41,441 INFO L439 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28) (and .cse1 (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28)))) [2019-11-16 00:03:41,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:03:41,441 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 573) no Hoare annotation was computed. [2019-11-16 00:03:41,441 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 584) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 595) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L439 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-16 00:03:41,442 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 596) the Hoare annotation is: (let ((.cse29 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse28 (not .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse13 .cse14 .cse28) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse17 .cse18 .cse19 .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse13 .cse14 .cse28)))) [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-16 00:03:41,442 INFO L443 ceAbstractionStarter]: For program point L286-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,443 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-16 00:03:41,443 INFO L443 ceAbstractionStarter]: For program point L320-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,443 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 572) no Hoare annotation was computed. [2019-11-16 00:03:41,443 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 583) no Hoare annotation was computed. [2019-11-16 00:03:41,443 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 594) no Hoare annotation was computed. [2019-11-16 00:03:41,444 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 71 632) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 558) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 522) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 552 558) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-16 00:03:41,445 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 573) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-11-16 00:03:41,445 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 584) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-16 00:03:41,446 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 594) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 571) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 582) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 593) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L446 ceAbstractionStarter]: At program point L621(lines 97 622) the Hoare annotation is: true [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2019-11-16 00:03:41,446 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 207 564) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:03:41,447 INFO L443 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-16 00:03:41,448 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-16 00:03:41,448 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 570) no Hoare annotation was computed. [2019-11-16 00:03:41,448 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 581) no Hoare annotation was computed. [2019-11-16 00:03:41,448 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 592) no Hoare annotation was computed. [2019-11-16 00:03:41,448 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 571) the Hoare annotation is: (let ((.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse26 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24))) [2019-11-16 00:03:41,449 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 582) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse19 .cse26 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and (and .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19 .cse21 .cse22 .cse27 .cse23) .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-16 00:03:41,449 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-11-16 00:03:41,449 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 628) no Hoare annotation was computed. [2019-11-16 00:03:41,449 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 537) no Hoare annotation was computed. [2019-11-16 00:03:41,450 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-16 00:03:41,450 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-16 00:03:41,450 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 569) no Hoare annotation was computed. [2019-11-16 00:03:41,450 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 580) no Hoare annotation was computed. [2019-11-16 00:03:41,450 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 591) no Hoare annotation was computed. [2019-11-16 00:03:41,451 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 620) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse19 (not .cse20)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse12 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse4 .cse13 .cse5 .cse6 .cse14 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse17 .cse18 .cse7 .cse8 .cse9 .cse10 .cse19) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21) (and .cse22 .cse19) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse19) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)))))) [2019-11-16 00:03:41,451 INFO L439 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-16 00:03:41,451 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-16 00:03:41,452 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 580) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse26 (not .cse27)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse22 .cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse25) (and .cse0 .cse28 .cse29 .cse30) (and .cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse29 .cse27 .cse30)))) [2019-11-16 00:03:41,452 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 593) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse30 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse29 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse30 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse30 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29))) [2019-11-16 00:03:41,452 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 568) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 579) no Hoare annotation was computed. [2019-11-16 00:03:41,453 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 590) no Hoare annotation was computed. [2019-11-16 00:03:41,454 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 601) no Hoare annotation was computed. [2019-11-16 00:03:41,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:03:41 BoogieIcfgContainer [2019-11-16 00:03:41,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:03:41,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:03:41,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:03:41,537 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:03:41,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:06" (3/4) ... [2019-11-16 00:03:41,541 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:03:41,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:03:41,560 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:03:41,726 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_72860563-7c38-4e69-aba9-f1290a5ea792/bin/uautomizer/witness.graphml [2019-11-16 00:03:41,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:03:41,728 INFO L168 Benchmark]: Toolchain (without parser) took 37403.42 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 944.8 MB in the beginning and 999.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,728 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:03:41,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,730 INFO L168 Benchmark]: Boogie Preprocessor took 63.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,730 INFO L168 Benchmark]: RCFGBuilder took 1106.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,730 INFO L168 Benchmark]: TraceAbstraction took 35432.09 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,731 INFO L168 Benchmark]: Witness Printer took 189.46 ms. Allocated memory is still 3.0 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:41,733 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 503.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1106.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35432.09 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 189.46 ms. Allocated memory is still 3.0 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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: 634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((8448 <= s__state && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && 0 == s__hit) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8480)) && s__state <= 8576)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576)) || (4 == blastFlag && !(0 == s__hit))) || s__state <= 3) || (blastFlag <= 2 && !(0 == s__hit))) || ((8448 <= s__state && s__state <= 8448) && 4 == blastFlag && s__s3__tmp__next_state___0 <= 3) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8608) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((((8448 <= s__state && 3 == blastFlag) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576)) || (4 == blastFlag && !(0 == s__hit))) || s__state <= 3) || (blastFlag <= 2 && !(0 == s__hit))) || ((8448 <= s__state && s__state <= 8448) && 4 == blastFlag && s__s3__tmp__next_state___0 <= 3) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Result: SAFE, OverallTime: 35.2s, OverallIterations: 39, TraceHistogramMax: 46, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.4s, HoareTripleCheckerStatistics: 7425 SDtfs, 5594 SDslu, 2523 SDs, 0 SdLazy, 3264 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3651 GetRequests, 3598 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 1350 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 271 NumberOfFragments, 7990 HoareAnnotationTreeSize, 28 FomulaSimplifications, 38976 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 10722 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 13581 NumberOfCodeBlocks, 13581 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 13535 ConstructedInterpolants, 0 QuantifiedInterpolants, 9879497 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5422 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 92901/93135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...