./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.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_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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 04e0282fb07d3e422f01aa279aee523182698ba7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:48:40,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:48:40,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:48:40,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:48:40,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:48:40,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:48:40,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:48:40,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:48:40,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:48:40,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:48:40,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:48:40,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:48:40,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:48:40,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:48:40,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:48:40,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:48:40,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:48:40,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:48:40,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:48:40,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:48:40,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:48:40,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:48:40,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:48:40,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:48:40,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:48:40,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:48:40,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:48:40,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:48:40,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:48:40,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:48:40,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:48:40,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:48:40,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:48:40,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:48:40,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:48:40,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:48:40,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:48:40,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:48:40,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:48:40,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:48:40,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:48:40,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:48:40,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:48:40,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:48:40,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:48:40,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:48:40,596 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:48:40,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:48:40,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:48:40,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:48:40,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:48:40,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:48:40,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:48:40,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:48:40,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:48:40,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:48:40,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:48:40,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:48:40,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:48:40,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:48:40,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:48:40,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:48:40,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:48:40,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:48:40,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:48:40,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:48:40,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:48:40,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:48:40,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:48:40,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:48:40,602 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_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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 -> 04e0282fb07d3e422f01aa279aee523182698ba7 [2019-11-15 20:48:40,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:48:40,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:48:40,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:48:40,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:48:40,650 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:48:40,651 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-15 20:48:40,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/data/3b1dea34a/31cf2488d4444184acf9a84bffb7f49c/FLAG84b2047b0 [2019-11-15 20:48:41,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:48:41,204 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-11-15 20:48:41,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/data/3b1dea34a/31cf2488d4444184acf9a84bffb7f49c/FLAG84b2047b0 [2019-11-15 20:48:41,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/data/3b1dea34a/31cf2488d4444184acf9a84bffb7f49c [2019-11-15 20:48:41,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:48:41,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:48:41,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:48:41,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:48:41,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:48:41,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:48:41" (1/1) ... [2019-11-15 20:48:41,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6d2bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:41, skipping insertion in model container [2019-11-15 20:48:41,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:48:41" (1/1) ... [2019-11-15 20:48:41,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:48:41,755 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:48:42,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:48:42,071 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:48:42,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:48:42,172 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:48:42,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42 WrapperNode [2019-11-15 20:48:42,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:48:42,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:48:42,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:48:42,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:48:42,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:48:42,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:48:42,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:48:42,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:48:42,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... [2019-11-15 20:48:42,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:48:42,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:48:42,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:48:42,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:48:42,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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-15 20:48:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:48:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:48:42,550 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:48:43,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 20:48:43,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 20:48:43,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:48:43,344 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:48:43,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:43 BoogieIcfgContainer [2019-11-15 20:48:43,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:48:43,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:48:43,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:48:43,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:48:43,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:48:41" (1/3) ... [2019-11-15 20:48:43,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e41778d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:48:43, skipping insertion in model container [2019-11-15 20:48:43,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:48:42" (2/3) ... [2019-11-15 20:48:43,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e41778d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:48:43, skipping insertion in model container [2019-11-15 20:48:43,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:43" (3/3) ... [2019-11-15 20:48:43,357 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-11-15 20:48:43,368 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:48:43,382 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:48:43,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:48:43,419 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:48:43,419 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:48:43,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:48:43,420 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:48:43,420 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:48:43,420 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:48:43,420 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:48:43,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:48:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-15 20:48:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 20:48:43,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:43,452 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, 1] [2019-11-15 20:48:43,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-11-15 20:48:43,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:43,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36321139] [2019-11-15 20:48:43,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:43,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:43,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:43,687 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-15 20:48:43,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36321139] [2019-11-15 20:48:43,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:43,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:43,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512998805] [2019-11-15 20:48:43,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:43,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:43,708 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-15 20:48:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:44,002 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-15 20:48:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:44,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 20:48:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:44,016 INFO L225 Difference]: With dead ends: 327 [2019-11-15 20:48:44,016 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 20:48:44,019 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-15 20:48:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 20:48:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-15 20:48:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 20:48:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-15 20:48:44,101 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-15 20:48:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:44,103 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-15 20:48:44,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-15 20:48:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:48:44,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:44,109 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, 1, 1] [2019-11-15 20:48:44,109 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-11-15 20:48:44,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:44,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476971529] [2019-11-15 20:48:44,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:44,226 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-15 20:48:44,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476971529] [2019-11-15 20:48:44,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:44,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:44,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310707988] [2019-11-15 20:48:44,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:44,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:44,230 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-15 20:48:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:44,472 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-15 20:48:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:44,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 20:48:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:44,476 INFO L225 Difference]: With dead ends: 379 [2019-11-15 20:48:44,476 INFO L226 Difference]: Without dead ends: 215 [2019-11-15 20:48:44,478 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-15 20:48:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-15 20:48:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-15 20:48:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 20:48:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-15 20:48:44,512 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-15 20:48:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:44,513 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-15 20:48:44,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-15 20:48:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 20:48:44,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:44,516 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, 1, 1] [2019-11-15 20:48:44,516 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-11-15 20:48:44,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:44,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934160373] [2019-11-15 20:48:44,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:44,627 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-15 20:48:44,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934160373] [2019-11-15 20:48:44,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:44,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:44,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561946697] [2019-11-15 20:48:44,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:44,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:44,630 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-15 20:48:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:44,821 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-15 20:48:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:44,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 20:48:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:44,824 INFO L225 Difference]: With dead ends: 444 [2019-11-15 20:48:44,825 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 20:48:44,826 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-15 20:48:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 20:48:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-15 20:48:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 20:48:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-15 20:48:44,847 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-15 20:48:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:44,847 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-15 20:48:44,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-15 20:48:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 20:48:44,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:44,856 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, 1, 1] [2019-11-15 20:48:44,858 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-11-15 20:48:44,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:44,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367393077] [2019-11-15 20:48:44,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:44,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:44,932 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-15 20:48:44,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367393077] [2019-11-15 20:48:44,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:44,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:44,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632120483] [2019-11-15 20:48:44,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:44,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:44,934 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-15 20:48:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:45,103 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-15 20:48:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:45,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 20:48:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:45,106 INFO L225 Difference]: With dead ends: 492 [2019-11-15 20:48:45,106 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 20:48:45,107 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-15 20:48:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 20:48:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-15 20:48:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-15 20:48:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-15 20:48:45,121 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-15 20:48:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:45,122 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-15 20:48:45,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-15 20:48:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 20:48:45,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:45,125 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:45,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-11-15 20:48:45,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:45,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274999627] [2019-11-15 20:48:45,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:45,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274999627] [2019-11-15 20:48:45,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:45,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:45,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615037884] [2019-11-15 20:48:45,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:45,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:45,209 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-15 20:48:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:45,418 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-15 20:48:45,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:45,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 20:48:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:45,421 INFO L225 Difference]: With dead ends: 551 [2019-11-15 20:48:45,421 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 20:48:45,422 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-15 20:48:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 20:48:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-15 20:48:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 20:48:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-15 20:48:45,434 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-15 20:48:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:45,434 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-15 20:48:45,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-15 20:48:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:48:45,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:45,436 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, 1, 1] [2019-11-15 20:48:45,437 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-11-15 20:48:45,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:45,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078410358] [2019-11-15 20:48:45,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:45,494 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-15 20:48:45,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078410358] [2019-11-15 20:48:45,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:45,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:45,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505783673] [2019-11-15 20:48:45,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:45,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:45,496 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-15 20:48:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:45,652 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-15 20:48:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:45,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 20:48:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:45,655 INFO L225 Difference]: With dead ends: 591 [2019-11-15 20:48:45,655 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 20:48:45,656 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-15 20:48:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 20:48:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-15 20:48:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 20:48:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-15 20:48:45,669 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-15 20:48:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:45,670 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-15 20:48:45,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-15 20:48:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:48:45,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:45,681 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:45,681 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-11-15 20:48:45,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:45,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183134936] [2019-11-15 20:48:45,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:45,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183134936] [2019-11-15 20:48:45,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:45,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:45,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509820849] [2019-11-15 20:48:45,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:45,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:45,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:45,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:45,747 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-15 20:48:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:45,941 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-15 20:48:45,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:45,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 20:48:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:45,944 INFO L225 Difference]: With dead ends: 593 [2019-11-15 20:48:45,944 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 20:48:45,945 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-15 20:48:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 20:48:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-15 20:48:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-15 20:48:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-15 20:48:45,956 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-15 20:48:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:45,957 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-15 20:48:45,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-15 20:48:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 20:48:45,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:45,959 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, 1, 1] [2019-11-15 20:48:45,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-11-15 20:48:45,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:45,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543172982] [2019-11-15 20:48:45,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:45,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:46,007 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-15 20:48:46,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543172982] [2019-11-15 20:48:46,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:46,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:46,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785661530] [2019-11-15 20:48:46,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:46,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:46,010 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-15 20:48:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:46,133 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-15 20:48:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:46,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 20:48:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:46,136 INFO L225 Difference]: With dead ends: 594 [2019-11-15 20:48:46,136 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 20:48:46,137 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-15 20:48:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 20:48:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-15 20:48:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-15 20:48:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-15 20:48:46,150 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-15 20:48:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:46,150 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-15 20:48:46,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-15 20:48:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:48:46,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:46,152 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, 1, 1] [2019-11-15 20:48:46,152 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-11-15 20:48:46,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:46,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442676156] [2019-11-15 20:48:46,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:46,192 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-15 20:48:46,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442676156] [2019-11-15 20:48:46,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:46,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:46,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986476329] [2019-11-15 20:48:46,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:46,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:46,194 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-15 20:48:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:46,360 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-15 20:48:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:46,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 20:48:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:46,364 INFO L225 Difference]: With dead ends: 634 [2019-11-15 20:48:46,364 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 20:48:46,364 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-15 20:48:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 20:48:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 20:48:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 20:48:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-15 20:48:46,380 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-15 20:48:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:46,380 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-15 20:48:46,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-15 20:48:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:48:46,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:46,384 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, 1, 1] [2019-11-15 20:48:46,385 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-11-15 20:48:46,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:46,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933864435] [2019-11-15 20:48:46,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:46,438 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-15 20:48:46,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933864435] [2019-11-15 20:48:46,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:46,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:46,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060207806] [2019-11-15 20:48:46,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:46,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:46,442 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-15 20:48:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:46,618 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-15 20:48:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:46,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 20:48:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:46,621 INFO L225 Difference]: With dead ends: 663 [2019-11-15 20:48:46,621 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 20:48:46,622 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-15 20:48:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 20:48:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 20:48:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 20:48:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-15 20:48:46,635 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-15 20:48:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:46,636 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-15 20:48:46,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-15 20:48:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:48:46,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:46,641 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, 1, 1] [2019-11-15 20:48:46,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-11-15 20:48:46,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:46,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327514647] [2019-11-15 20:48:46,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:46,696 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-15 20:48:46,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327514647] [2019-11-15 20:48:46,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:46,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:46,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327446168] [2019-11-15 20:48:46,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:46,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:46,699 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-15 20:48:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:46,867 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-15 20:48:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:46,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 20:48:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:46,870 INFO L225 Difference]: With dead ends: 696 [2019-11-15 20:48:46,870 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 20:48:46,871 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-15 20:48:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 20:48:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 20:48:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 20:48:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-15 20:48:46,886 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-15 20:48:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:46,887 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-15 20:48:46,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-15 20:48:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:48:46,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:46,891 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, 1, 1] [2019-11-15 20:48:46,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:46,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-11-15 20:48:46,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:46,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676111848] [2019-11-15 20:48:46,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:46,929 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-15 20:48:46,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676111848] [2019-11-15 20:48:46,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:46,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:46,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754830999] [2019-11-15 20:48:46,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:46,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:46,932 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-15 20:48:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:47,075 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-15 20:48:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:47,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-15 20:48:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:47,078 INFO L225 Difference]: With dead ends: 723 [2019-11-15 20:48:47,078 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 20:48:47,079 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-15 20:48:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 20:48:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 20:48:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 20:48:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-15 20:48:47,093 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-15 20:48:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:47,093 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-15 20:48:47,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-15 20:48:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 20:48:47,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:47,095 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:47,096 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-11-15 20:48:47,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:47,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635640822] [2019-11-15 20:48:47,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:48:47,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635640822] [2019-11-15 20:48:47,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:47,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:47,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549765960] [2019-11-15 20:48:47,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:47,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:47,135 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-15 20:48:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:47,269 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-15 20:48:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:47,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 20:48:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:47,272 INFO L225 Difference]: With dead ends: 740 [2019-11-15 20:48:47,272 INFO L226 Difference]: Without dead ends: 386 [2019-11-15 20:48:47,273 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-15 20:48:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-15 20:48:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-15 20:48:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 20:48:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-15 20:48:47,286 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-15 20:48:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:47,287 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-15 20:48:47,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-15 20:48:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 20:48:47,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:47,289 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:47,289 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-11-15 20:48:47,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:47,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80695576] [2019-11-15 20:48:47,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:48:47,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80695576] [2019-11-15 20:48:47,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:47,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:47,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707852974] [2019-11-15 20:48:47,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:47,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:47,324 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-15 20:48:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:47,502 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-15 20:48:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:47,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 20:48:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:47,506 INFO L225 Difference]: With dead ends: 761 [2019-11-15 20:48:47,506 INFO L226 Difference]: Without dead ends: 386 [2019-11-15 20:48:47,508 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-15 20:48:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-15 20:48:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-15 20:48:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 20:48:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-15 20:48:47,526 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-15 20:48:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:47,526 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-15 20:48:47,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-15 20:48:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 20:48:47,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:47,529 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:47,529 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-11-15 20:48:47,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:47,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932990624] [2019-11-15 20:48:47,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 20:48:47,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932990624] [2019-11-15 20:48:47,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:47,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:47,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671917773] [2019-11-15 20:48:47,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:47,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:47,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:47,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:47,596 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-15 20:48:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:47,649 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-15 20:48:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:47,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 20:48:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:47,655 INFO L225 Difference]: With dead ends: 757 [2019-11-15 20:48:47,655 INFO L226 Difference]: Without dead ends: 755 [2019-11-15 20:48:47,657 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-15 20:48:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-15 20:48:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-15 20:48:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-15 20:48:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-15 20:48:47,690 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-15 20:48:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:47,691 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-15 20:48:47,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-15 20:48:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 20:48:47,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:47,694 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, 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] [2019-11-15 20:48:47,695 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-11-15 20:48:47,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:47,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195352347] [2019-11-15 20:48:47,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:47,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:48:47,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195352347] [2019-11-15 20:48:47,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:47,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:47,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479898877] [2019-11-15 20:48:47,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:47,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:47,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:47,769 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-15 20:48:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:48,009 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-11-15 20:48:48,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:48,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 20:48:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:48,016 INFO L225 Difference]: With dead ends: 1587 [2019-11-15 20:48:48,017 INFO L226 Difference]: Without dead ends: 839 [2019-11-15 20:48:48,018 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-15 20:48:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-15 20:48:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-11-15 20:48:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-15 20:48:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-11-15 20:48:48,060 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-11-15 20:48:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:48,061 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-11-15 20:48:48,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-11-15 20:48:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 20:48:48,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:48,064 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, 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] [2019-11-15 20:48:48,065 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-11-15 20:48:48,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:48,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784334562] [2019-11-15 20:48:48,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:48:48,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784334562] [2019-11-15 20:48:48,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:48,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:48,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839492354] [2019-11-15 20:48:48,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:48,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:48,114 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-11-15 20:48:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:48,341 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-11-15 20:48:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:48,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 20:48:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:48,348 INFO L225 Difference]: With dead ends: 1663 [2019-11-15 20:48:48,348 INFO L226 Difference]: Without dead ends: 835 [2019-11-15 20:48:48,350 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-15 20:48:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-15 20:48:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-11-15 20:48:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-11-15 20:48:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-11-15 20:48:48,384 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-11-15 20:48:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:48,384 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-11-15 20:48:48,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-11-15 20:48:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 20:48:48,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:48,388 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, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:48,388 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-11-15 20:48:48,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:48,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104336301] [2019-11-15 20:48:48,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:48:48,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104336301] [2019-11-15 20:48:48,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:48,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:48,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587929622] [2019-11-15 20:48:48,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:48,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:48,448 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-11-15 20:48:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:48,672 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-11-15 20:48:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:48,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-15 20:48:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:48,680 INFO L225 Difference]: With dead ends: 1723 [2019-11-15 20:48:48,680 INFO L226 Difference]: Without dead ends: 903 [2019-11-15 20:48:48,682 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-15 20:48:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-15 20:48:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-11-15 20:48:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-11-15 20:48:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-11-15 20:48:48,724 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-11-15 20:48:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:48,724 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-11-15 20:48:48,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-11-15 20:48:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 20:48:48,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:48,729 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, 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, 1, 1] [2019-11-15 20:48:48,729 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-11-15 20:48:48,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:48,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062393670] [2019-11-15 20:48:48,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:48,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 20:48:48,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062393670] [2019-11-15 20:48:48,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:48,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:48,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854813144] [2019-11-15 20:48:48,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:48,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:48,788 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-11-15 20:48:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:48,997 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-11-15 20:48:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:48,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-15 20:48:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:49,003 INFO L225 Difference]: With dead ends: 1795 [2019-11-15 20:48:49,003 INFO L226 Difference]: Without dead ends: 899 [2019-11-15 20:48:49,004 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-15 20:48:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-11-15 20:48:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-11-15 20:48:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-15 20:48:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-11-15 20:48:49,036 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-11-15 20:48:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:49,037 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-11-15 20:48:49,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-11-15 20:48:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 20:48:49,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:49,040 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:49,041 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-11-15 20:48:49,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:49,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709805449] [2019-11-15 20:48:49,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-15 20:48:49,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709805449] [2019-11-15 20:48:49,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:49,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:49,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871333486] [2019-11-15 20:48:49,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:49,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:49,116 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-11-15 20:48:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:49,316 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-11-15 20:48:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:49,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-15 20:48:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:49,323 INFO L225 Difference]: With dead ends: 1855 [2019-11-15 20:48:49,323 INFO L226 Difference]: Without dead ends: 967 [2019-11-15 20:48:49,325 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-15 20:48:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-11-15 20:48:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-11-15 20:48:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-15 20:48:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-11-15 20:48:49,369 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-11-15 20:48:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:49,370 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-11-15 20:48:49,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-11-15 20:48:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 20:48:49,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:49,374 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:49,375 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-11-15 20:48:49,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:49,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711264787] [2019-11-15 20:48:49,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-15 20:48:49,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711264787] [2019-11-15 20:48:49,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:49,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:49,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881239422] [2019-11-15 20:48:49,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:49,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:49,439 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-11-15 20:48:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:49,666 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-11-15 20:48:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:49,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-15 20:48:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:49,673 INFO L225 Difference]: With dead ends: 1923 [2019-11-15 20:48:49,673 INFO L226 Difference]: Without dead ends: 963 [2019-11-15 20:48:49,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-15 20:48:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-15 20:48:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-11-15 20:48:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-15 20:48:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-11-15 20:48:49,719 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-11-15 20:48:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:49,719 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-11-15 20:48:49,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-11-15 20:48:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 20:48:49,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:49,724 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1] [2019-11-15 20:48:49,724 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-11-15 20:48:49,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:49,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559687140] [2019-11-15 20:48:49,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:49,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-15 20:48:49,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559687140] [2019-11-15 20:48:49,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:49,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:49,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205541169] [2019-11-15 20:48:49,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:49,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:49,792 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-11-15 20:48:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:49,994 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-11-15 20:48:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:49,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-15 20:48:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:50,002 INFO L225 Difference]: With dead ends: 1987 [2019-11-15 20:48:50,002 INFO L226 Difference]: Without dead ends: 1035 [2019-11-15 20:48:50,006 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-15 20:48:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-15 20:48:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-15 20:48:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-15 20:48:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-11-15 20:48:50,053 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-11-15 20:48:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:50,053 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-11-15 20:48:50,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-11-15 20:48:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 20:48:50,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:50,059 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1] [2019-11-15 20:48:50,059 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-11-15 20:48:50,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:50,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831249806] [2019-11-15 20:48:50,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-15 20:48:50,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831249806] [2019-11-15 20:48:50,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:50,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:50,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699311902] [2019-11-15 20:48:50,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:50,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:50,166 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-11-15 20:48:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:50,377 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-11-15 20:48:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:50,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-15 20:48:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:50,384 INFO L225 Difference]: With dead ends: 2037 [2019-11-15 20:48:50,384 INFO L226 Difference]: Without dead ends: 1035 [2019-11-15 20:48:50,386 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-15 20:48:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-15 20:48:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-11-15 20:48:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-15 20:48:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-11-15 20:48:50,424 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-11-15 20:48:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:50,424 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-11-15 20:48:50,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-11-15 20:48:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 20:48:50,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:50,429 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:50,429 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:50,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-11-15 20:48:50,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:50,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999982083] [2019-11-15 20:48:50,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-15 20:48:50,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999982083] [2019-11-15 20:48:50,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:50,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:50,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616706541] [2019-11-15 20:48:50,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:50,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:50,494 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-11-15 20:48:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:50,679 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-11-15 20:48:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:50,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-15 20:48:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:50,686 INFO L225 Difference]: With dead ends: 2019 [2019-11-15 20:48:50,686 INFO L226 Difference]: Without dead ends: 1017 [2019-11-15 20:48:50,687 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-15 20:48:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-15 20:48:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-11-15 20:48:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-15 20:48:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-11-15 20:48:50,724 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-11-15 20:48:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:50,724 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-11-15 20:48:50,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-11-15 20:48:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 20:48:50,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:50,729 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:50,729 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-11-15 20:48:50,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:50,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975860986] [2019-11-15 20:48:50,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:50,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-15 20:48:50,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975860986] [2019-11-15 20:48:50,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:50,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:50,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111851601] [2019-11-15 20:48:50,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:50,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:50,790 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-11-15 20:48:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:50,965 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-11-15 20:48:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:50,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-15 20:48:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:50,971 INFO L225 Difference]: With dead ends: 2019 [2019-11-15 20:48:50,971 INFO L226 Difference]: Without dead ends: 999 [2019-11-15 20:48:50,973 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-15 20:48:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-15 20:48:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-11-15 20:48:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 20:48:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-11-15 20:48:51,006 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-11-15 20:48:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:51,007 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-11-15 20:48:51,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-11-15 20:48:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-15 20:48:51,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:51,011 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2019-11-15 20:48:51,011 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-11-15 20:48:51,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:51,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306334846] [2019-11-15 20:48:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-15 20:48:51,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306334846] [2019-11-15 20:48:51,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:51,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:51,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337444724] [2019-11-15 20:48:51,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:51,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:51,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:51,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:51,080 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-11-15 20:48:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:51,248 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-11-15 20:48:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:51,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-15 20:48:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:51,255 INFO L225 Difference]: With dead ends: 2029 [2019-11-15 20:48:51,255 INFO L226 Difference]: Without dead ends: 1045 [2019-11-15 20:48:51,256 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-15 20:48:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-15 20:48:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-11-15 20:48:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-15 20:48:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-11-15 20:48:51,294 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-11-15 20:48:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-11-15 20:48:51,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-11-15 20:48:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 20:48:51,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:51,298 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2019-11-15 20:48:51,298 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-11-15 20:48:51,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:51,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531491287] [2019-11-15 20:48:51,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-15 20:48:51,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531491287] [2019-11-15 20:48:51,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:51,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:48:51,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10028809] [2019-11-15 20:48:51,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:51,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:51,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:51,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:51,361 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-11-15 20:48:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:51,500 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-11-15 20:48:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:51,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-15 20:48:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:51,507 INFO L225 Difference]: With dead ends: 2075 [2019-11-15 20:48:51,507 INFO L226 Difference]: Without dead ends: 1037 [2019-11-15 20:48:51,508 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-15 20:48:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-11-15 20:48:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-11-15 20:48:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-11-15 20:48:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-11-15 20:48:51,546 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-11-15 20:48:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:51,547 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-11-15 20:48:51,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-11-15 20:48:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-15 20:48:51,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:51,551 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:51,551 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-11-15 20:48:51,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:51,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354472401] [2019-11-15 20:48:51,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:51,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 20:48:51,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354472401] [2019-11-15 20:48:51,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782660622] [2019-11-15 20:48:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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-15 20:48:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:51,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:48:51,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-15 20:48:51,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:48:51,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:48:51,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696048140] [2019-11-15 20:48:51,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:51,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:48:51,951 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 3 states. [2019-11-15 20:48:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:52,031 INFO L93 Difference]: Finished difference Result 2561 states and 3720 transitions. [2019-11-15 20:48:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:52,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-11-15 20:48:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:52,041 INFO L225 Difference]: With dead ends: 2561 [2019-11-15 20:48:52,042 INFO L226 Difference]: Without dead ends: 1539 [2019-11-15 20:48:52,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 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-15 20:48:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-15 20:48:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-11-15 20:48:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-11-15 20:48:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2235 transitions. [2019-11-15 20:48:52,115 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2235 transitions. Word has length 261 [2019-11-15 20:48:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:52,115 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 2235 transitions. [2019-11-15 20:48:52,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2235 transitions. [2019-11-15 20:48:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 20:48:52,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:52,122 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:52,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:52,328 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:52,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-11-15 20:48:52,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:52,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049566092] [2019-11-15 20:48:52,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:52,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:52,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-15 20:48:52,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049566092] [2019-11-15 20:48:52,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:52,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:52,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552883946] [2019-11-15 20:48:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:52,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:52,525 INFO L87 Difference]: Start difference. First operand 1539 states and 2235 transitions. Second operand 3 states. [2019-11-15 20:48:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:52,633 INFO L93 Difference]: Finished difference Result 4522 states and 6563 transitions. [2019-11-15 20:48:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:52,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-15 20:48:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:52,651 INFO L225 Difference]: With dead ends: 4522 [2019-11-15 20:48:52,651 INFO L226 Difference]: Without dead ends: 2990 [2019-11-15 20:48:52,656 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-15 20:48:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-11-15 20:48:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2019-11-15 20:48:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-11-15 20:48:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4329 transitions. [2019-11-15 20:48:52,781 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4329 transitions. Word has length 268 [2019-11-15 20:48:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:52,781 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 4329 transitions. [2019-11-15 20:48:52,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4329 transitions. [2019-11-15 20:48:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 20:48:52,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:52,790 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:52,790 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-11-15 20:48:52,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:52,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140635253] [2019-11-15 20:48:52,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:52,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:52,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-15 20:48:52,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140635253] [2019-11-15 20:48:52,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:52,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:52,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326624693] [2019-11-15 20:48:52,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:52,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:52,917 INFO L87 Difference]: Start difference. First operand 2988 states and 4329 transitions. Second operand 3 states. [2019-11-15 20:48:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:53,162 INFO L93 Difference]: Finished difference Result 6089 states and 8839 transitions. [2019-11-15 20:48:53,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:53,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 20:48:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:53,175 INFO L225 Difference]: With dead ends: 6089 [2019-11-15 20:48:53,175 INFO L226 Difference]: Without dead ends: 1991 [2019-11-15 20:48:53,181 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-15 20:48:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-15 20:48:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1971. [2019-11-15 20:48:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-15 20:48:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2807 transitions. [2019-11-15 20:48:53,255 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2807 transitions. Word has length 305 [2019-11-15 20:48:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:53,256 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2807 transitions. [2019-11-15 20:48:53,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2807 transitions. [2019-11-15 20:48:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-15 20:48:53,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:53,263 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:53,264 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1127702344, now seen corresponding path program 1 times [2019-11-15 20:48:53,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:53,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686527103] [2019-11-15 20:48:53,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:53,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:53,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-15 20:48:53,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686527103] [2019-11-15 20:48:53,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535681966] [2019-11-15 20:48:53,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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-15 20:48:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:53,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:48:53,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-15 20:48:53,782 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:53,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 20:48:53,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141135583] [2019-11-15 20:48:53,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:53,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:53,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:53,788 INFO L87 Difference]: Start difference. First operand 1971 states and 2807 transitions. Second operand 4 states. [2019-11-15 20:48:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:54,172 INFO L93 Difference]: Finished difference Result 4561 states and 6484 transitions. [2019-11-15 20:48:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:48:54,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-11-15 20:48:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:54,195 INFO L225 Difference]: With dead ends: 4561 [2019-11-15 20:48:54,202 INFO L226 Difference]: Without dead ends: 2553 [2019-11-15 20:48:54,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 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-15 20:48:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-15 20:48:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1942. [2019-11-15 20:48:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 20:48:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-15 20:48:54,281 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 371 [2019-11-15 20:48:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:54,281 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-15 20:48:54,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:48:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-15 20:48:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-15 20:48:54,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:54,295 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 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] [2019-11-15 20:48:54,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:54,500 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:54,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-11-15 20:48:54,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:54,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468162992] [2019-11-15 20:48:54,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:54,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:54,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 20:48:55,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468162992] [2019-11-15 20:48:55,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689973582] [2019-11-15 20:48:55,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/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-15 20:48:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:55,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:48:55,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 20:48:55,497 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:55,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 20:48:55,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448304746] [2019-11-15 20:48:55,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:48:55,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:55,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:48:55,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:48:55,502 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-11-15 20:48:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:55,838 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-11-15 20:48:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:48:55,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-11-15 20:48:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:55,845 INFO L225 Difference]: With dead ends: 4797 [2019-11-15 20:48:55,845 INFO L226 Difference]: Without dead ends: 2724 [2019-11-15 20:48:55,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 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-15 20:48:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-11-15 20:48:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-11-15 20:48:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 20:48:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-11-15 20:48:55,950 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-11-15 20:48:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:55,951 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-11-15 20:48:55,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:48:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-11-15 20:48:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-11-15 20:48:55,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:55,971 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:56,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:56,185 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-11-15 20:48:56,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:56,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060905791] [2019-11-15 20:48:56,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:56,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:56,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-15 20:48:56,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060905791] [2019-11-15 20:48:56,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:56,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:56,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027660666] [2019-11-15 20:48:56,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:56,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:56,732 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-11-15 20:48:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:56,984 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-11-15 20:48:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:56,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-11-15 20:48:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:56,990 INFO L225 Difference]: With dead ends: 3917 [2019-11-15 20:48:56,990 INFO L226 Difference]: Without dead ends: 1982 [2019-11-15 20:48:56,994 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-15 20:48:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-15 20:48:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-11-15 20:48:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 20:48:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-11-15 20:48:57,078 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-11-15 20:48:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:57,079 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-11-15 20:48:57,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-11-15 20:48:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-15 20:48:57,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:57,101 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:57,102 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-11-15 20:48:57,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:57,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416710043] [2019-11-15 20:48:57,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:57,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:57,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-15 20:48:57,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416710043] [2019-11-15 20:48:57,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:57,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:57,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622117013] [2019-11-15 20:48:57,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:57,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:57,502 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-11-15 20:48:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:57,698 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-11-15 20:48:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:57,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-15 20:48:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:57,702 INFO L225 Difference]: With dead ends: 3892 [2019-11-15 20:48:57,703 INFO L226 Difference]: Without dead ends: 1957 [2019-11-15 20:48:57,706 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-15 20:48:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-11-15 20:48:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-11-15 20:48:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-11-15 20:48:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-11-15 20:48:57,771 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-11-15 20:48:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:57,771 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-11-15 20:48:57,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-11-15 20:48:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-11-15 20:48:57,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:57,779 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:57,779 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-11-15 20:48:57,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:57,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507418430] [2019-11-15 20:48:57,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:57,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:57,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-15 20:48:58,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507418430] [2019-11-15 20:48:58,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:58,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:58,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211604114] [2019-11-15 20:48:58,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:58,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:58,163 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-11-15 20:48:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:58,365 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-11-15 20:48:58,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:58,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-11-15 20:48:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:58,370 INFO L225 Difference]: With dead ends: 3921 [2019-11-15 20:48:58,370 INFO L226 Difference]: Without dead ends: 1981 [2019-11-15 20:48:58,373 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-15 20:48:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-11-15 20:48:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-11-15 20:48:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-15 20:48:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-11-15 20:48:58,457 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-11-15 20:48:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:58,458 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-11-15 20:48:58,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-11-15 20:48:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-11-15 20:48:58,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:58,470 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:48:58,470 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-11-15 20:48:58,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:58,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836646621] [2019-11-15 20:48:58,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:58,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:58,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-15 20:48:58,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836646621] [2019-11-15 20:48:58,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:58,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:48:58,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140646791] [2019-11-15 20:48:58,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:48:58,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:58,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:48:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:48:58,987 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-11-15 20:48:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:59,135 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-11-15 20:48:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:48:59,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-11-15 20:48:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:59,137 INFO L225 Difference]: With dead ends: 2519 [2019-11-15 20:48:59,137 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:48:59,140 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-15 20:48:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:48:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:48:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:48:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:48:59,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-11-15 20:48:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:59,141 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:48:59,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:48:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:48:59,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:48:59,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:48:59,654 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-15 20:48:59,970 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-11-15 20:49:00,731 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:01,282 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 20:49:01,762 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:02,200 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-15 20:49:02,574 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-15 20:49:03,102 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:03,963 WARN L191 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-15 20:49:04,399 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-15 20:49:05,246 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-15 20:49:05,603 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:05,850 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-11-15 20:49:06,140 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 20:49:06,493 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-15 20:49:06,831 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:07,237 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-15 20:49:07,598 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:08,059 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:08,628 WARN L191 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 20:49:09,006 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 20:49:09,351 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-15 20:49:09,353 INFO L446 ceAbstractionStarter]: At program point L597(lines 97 598) the Hoare annotation is: true [2019-11-15 20:49:09,353 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 533) no Hoare annotation was computed. [2019-11-15 20:49:09,353 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-15 20:49:09,353 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-15 20:49:09,353 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-15 20:49:09,354 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 545) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (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 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 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)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-15 20:49:09,354 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 577) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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 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)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 543) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 554) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 565) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 576) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L443 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-15 20:49:09,355 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 20:49:09,356 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 555) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (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)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-15 20:49:09,356 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (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)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11)))) [2019-11-15 20:49:09,356 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 604) no Hoare annotation was computed. [2019-11-15 20:49:09,356 INFO L443 ceAbstractionStarter]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2019-11-15 20:49:09,357 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 506) no Hoare annotation was computed. [2019-11-15 20:49:09,357 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-15 20:49:09,357 INFO L439 ceAbstractionStarter]: At program point L206(lines 205 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 20:49:09,357 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 553) no Hoare annotation was computed. [2019-11-15 20:49:09,357 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 564) no Hoare annotation was computed. [2019-11-15 20:49:09,358 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 575) no Hoare annotation was computed. [2019-11-15 20:49:09,358 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-15 20:49:09,358 INFO L443 ceAbstractionStarter]: For program point L273-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,358 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-15 20:49:09,358 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 552) no Hoare annotation was computed. [2019-11-15 20:49:09,359 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 563) no Hoare annotation was computed. [2019-11-15 20:49:09,360 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 574) no Hoare annotation was computed. [2019-11-15 20:49:09,360 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-15 20:49:09,360 INFO L443 ceAbstractionStarter]: For program point L474-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,360 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-15 20:49:09,360 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-15 20:49:09,361 INFO L439 ceAbstractionStarter]: At program point L210(lines 104 576) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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 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)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,361 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 553) 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 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (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 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,362 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 564) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,362 INFO L446 ceAbstractionStarter]: At program point L607(lines 10 609) the Hoare annotation is: true [2019-11-15 20:49:09,362 INFO L439 ceAbstractionStarter]: At program point L541(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (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)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,363 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-15 20:49:09,363 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-15 20:49:09,363 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 551) no Hoare annotation was computed. [2019-11-15 20:49:09,363 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 562) no Hoare annotation was computed. [2019-11-15 20:49:09,363 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 573) no Hoare annotation was computed. [2019-11-15 20:49:09,364 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-15 20:49:09,364 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-15 20:49:09,364 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 594) no Hoare annotation was computed. [2019-11-15 20:49:09,364 INFO L439 ceAbstractionStarter]: At program point L512(lines 71 608) the Hoare annotation is: false [2019-11-15 20:49:09,364 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 550) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 561) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 572) no Hoare annotation was computed. [2019-11-15 20:49:09,365 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 593) no Hoare annotation was computed. [2019-11-15 20:49:09,366 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-15 20:49:09,366 INFO L443 ceAbstractionStarter]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-15 20:49:09,366 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 551) the Hoare annotation is: (let ((.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 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (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 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,367 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,367 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-15 20:49:09,367 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-15 20:49:09,367 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-15 20:49:09,367 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-15 20:49:09,368 INFO L443 ceAbstractionStarter]: For program point L580-2(lines 579 593) no Hoare annotation was computed. [2019-11-15 20:49:09,368 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-15 20:49:09,368 INFO L439 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 549) no Hoare annotation was computed. [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 560) no Hoare annotation was computed. [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 571) no Hoare annotation was computed. [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 584) no Hoare annotation was computed. [2019-11-15 20:49:09,369 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-15 20:49:09,370 INFO L439 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (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 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,370 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (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)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 20:49:09,371 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-15 20:49:09,371 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-15 20:49:09,371 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-15 20:49:09,371 INFO L443 ceAbstractionStarter]: For program point L286-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,371 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L320-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 548) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 559) no Hoare annotation was computed. [2019-11-15 20:49:09,372 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 570) no Hoare annotation was computed. [2019-11-15 20:49:09,373 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-15 20:49:09,373 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 71 608) no Hoare annotation was computed. [2019-11-15 20:49:09,373 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-15 20:49:09,373 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 549) 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 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,374 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (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 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,374 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 570) 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-15 20:49:09,375 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-15 20:49:09,375 INFO L446 ceAbstractionStarter]: At program point L619(lines 610 621) the Hoare annotation is: true [2019-11-15 20:49:09,375 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-15 20:49:09,375 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:49:09,375 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 547) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 558) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 569) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-15 20:49:09,376 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-15 20:49:09,377 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,377 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 493) no Hoare annotation was computed. [2019-11-15 20:49:09,377 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-15 20:49:09,377 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-15 20:49:09,377 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:49:09,378 INFO L443 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-15 20:49:09,378 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-15 20:49:09,378 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 546) no Hoare annotation was computed. [2019-11-15 20:49:09,378 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 557) no Hoare annotation was computed. [2019-11-15 20:49:09,378 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 568) no Hoare annotation was computed. [2019-11-15 20:49:09,379 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 547) 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 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 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21))) [2019-11-15 20:49:09,379 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-15 20:49:09,379 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-15 20:49:09,380 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-15 20:49:09,380 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 545) no Hoare annotation was computed. [2019-11-15 20:49:09,380 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 556) no Hoare annotation was computed. [2019-11-15 20:49:09,380 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 567) no Hoare annotation was computed. [2019-11-15 20:49:09,381 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (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)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,381 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 534) no Hoare annotation was computed. [2019-11-15 20:49:09,381 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-15 20:49:09,381 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 528 534) no Hoare annotation was computed. [2019-11-15 20:49:09,381 INFO L443 ceAbstractionStarter]: For program point L495-2(lines 207 540) no Hoare annotation was computed. [2019-11-15 20:49:09,382 INFO L439 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (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 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,382 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-15 20:49:09,382 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (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)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-15 20:49:09,383 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (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)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 20:49:09,383 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 20:49:09,383 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-15 20:49:09,384 INFO L443 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-15 20:49:09,384 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 544) no Hoare annotation was computed. [2019-11-15 20:49:09,384 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 555) no Hoare annotation was computed. [2019-11-15 20:49:09,384 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 566) no Hoare annotation was computed. [2019-11-15 20:49:09,384 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 577) no Hoare annotation was computed. [2019-11-15 20:49:09,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:49:09 BoogieIcfgContainer [2019-11-15 20:49:09,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:49:09,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:49:09,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:49:09,445 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:49:09,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:48:43" (3/4) ... [2019-11-15 20:49:09,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:49:09,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:49:09,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:49:09,600 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2b614a8c-64bc-43ee-97d2-6b6b9a19a9d6/bin/uautomizer/witness.graphml [2019-11-15 20:49:09,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:49:09,602 INFO L168 Benchmark]: Toolchain (without parser) took 27923.47 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 944.7 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,603 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:49:09,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:49:09,604 INFO L168 Benchmark]: Boogie Preprocessor took 84.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,604 INFO L168 Benchmark]: RCFGBuilder took 1028.05 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,605 INFO L168 Benchmark]: TraceAbstraction took 26097.33 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -889.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,605 INFO L168 Benchmark]: Witness Printer took 156.64 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:49:09,607 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.11 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1028.05 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26097.33 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -889.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 156.64 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 140]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(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 == 8577) && blastFlag <= 3) && !(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)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(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) && blastFlag <= 3) && !(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 == 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 == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8673)) && !(s__state == 8529)) && !(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: ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 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 <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8673)) && !(s__state == 8529)) && !(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)) || (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 <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(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))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(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)) || ((((((((((((((((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)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(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))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(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)) || ((((((((((((((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) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(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)) || (((((((((((((((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) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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)) || (((((((((((((((((((((((((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 == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(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 == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 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__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) - 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: 152]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8673)) && !(s__state == 8529)) && !(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: 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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(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 == 8529)) && !(s__state == 8544)) && !(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: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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 == 8673)) && !(s__state == 8529)) && !(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: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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)) - 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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(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) && blastFlag <= 3) && !(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 == 8529)) && !(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 == 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: ((((((((((((((((blastFlag <= 2 && 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)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(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, 140 locations, 1 error locations. Result: SAFE, OverallTime: 25.9s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.2s, HoareTripleCheckerStatistics: 5516 SDtfs, 4845 SDslu, 1841 SDs, 0 SdLazy, 3378 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3523 HoareAnnotationTreeSize, 28 FomulaSimplifications, 29289 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7804 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9308 ConstructedInterpolants, 0 QuantifiedInterpolants, 4566453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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...