./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.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_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/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 eba2b941566e2fb2ae010597707522fdb9036fd8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:34:54,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:34:54,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:34:54,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:34:54,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:34:54,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:34:54,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:34:54,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:34:54,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:34:54,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:34:54,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:34:54,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:34:54,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:34:54,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:34:54,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:34:54,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:34:54,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:34:54,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:34:54,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:34:54,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:34:54,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:34:54,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:34:54,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:34:54,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:34:54,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:34:54,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:34:54,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:34:54,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:34:54,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:34:54,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:34:54,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:34:54,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:34:54,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:34:54,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:34:54,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:34:54,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:34:54,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:34:54,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:34:54,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:34:54,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:34:54,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:34:54,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:34:54,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:34:54,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:34:54,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:34:54,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:34:54,343 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:34:54,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:34:54,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:34:54,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:34:54,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:34:54,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:34:54,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:34:54,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:34:54,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:34:54,345 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:34:54,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:34:54,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:34:54,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:34:54,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:34:54,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:34:54,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:34:54,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:34:54,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:34:54,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:34:54,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:34:54,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:34:54,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:34:54,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:34:54,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:34:54,351 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_f174d560-ea13-4767-8100-c04d6f3eb57c/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 -> eba2b941566e2fb2ae010597707522fdb9036fd8 [2019-11-15 21:34:54,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:34:54,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:34:54,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:34:54,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:34:54,417 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:34:54,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-15 21:34:54,477 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/data/bccf23b6f/e3783ef2a956447cbe7836c5a4b9e90f/FLAG2e184bda7 [2019-11-15 21:34:54,923 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:34:54,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-15 21:34:54,947 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/data/bccf23b6f/e3783ef2a956447cbe7836c5a4b9e90f/FLAG2e184bda7 [2019-11-15 21:34:54,961 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/data/bccf23b6f/e3783ef2a956447cbe7836c5a4b9e90f [2019-11-15 21:34:54,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:34:54,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:34:54,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:54,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:34:54,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:34:54,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:54" (1/1) ... [2019-11-15 21:34:54,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55162313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:54, skipping insertion in model container [2019-11-15 21:34:54,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:54" (1/1) ... [2019-11-15 21:34:54,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:34:55,037 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:34:55,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:55,319 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:34:55,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:55,406 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:34:55,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55 WrapperNode [2019-11-15 21:34:55,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:55,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:34:55,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:34:55,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:34:55,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:34:55,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:34:55,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:34:55,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:34:55,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... [2019-11-15 21:34:55,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:34:55,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:34:55,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:34:55,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:34:55,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/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 21:34:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:34:55,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:34:55,734 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:34:56,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 21:34:56,344 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 21:34:56,345 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:34:56,345 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:34:56,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:56 BoogieIcfgContainer [2019-11-15 21:34:56,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:34:56,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:34:56,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:34:56,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:34:56,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:34:54" (1/3) ... [2019-11-15 21:34:56,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411a69f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:56, skipping insertion in model container [2019-11-15 21:34:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:55" (2/3) ... [2019-11-15 21:34:56,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411a69f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:56, skipping insertion in model container [2019-11-15 21:34:56,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:56" (3/3) ... [2019-11-15 21:34:56,356 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-15 21:34:56,365 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:34:56,374 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:34:56,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:34:56,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:34:56,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:34:56,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:34:56,429 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:34:56,430 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:34:56,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:34:56,430 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:34:56,430 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:34:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-15 21:34:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:34:56,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:56,461 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 21:34:56,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-11-15 21:34:56,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:56,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318152443] [2019-11-15 21:34:56,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:56,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:56,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:56,710 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 21:34:56,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318152443] [2019-11-15 21:34:56,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:56,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:56,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300556241] [2019-11-15 21:34:56,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:56,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:56,731 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-15 21:34:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:57,049 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-15 21:34:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:57,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 21:34:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:57,064 INFO L225 Difference]: With dead ends: 332 [2019-11-15 21:34:57,064 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 21:34:57,068 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 21:34:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 21:34:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-15 21:34:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:34:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-15 21:34:57,118 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-15 21:34:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:57,119 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-15 21:34:57,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-15 21:34:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:34:57,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:57,122 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, 1] [2019-11-15 21:34:57,122 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-11-15 21:34:57,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:57,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935804375] [2019-11-15 21:34:57,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:57,196 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 21:34:57,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935804375] [2019-11-15 21:34:57,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:57,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:57,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818411089] [2019-11-15 21:34:57,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:57,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:57,200 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-15 21:34:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:57,441 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-15 21:34:57,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:57,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-15 21:34:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:57,446 INFO L225 Difference]: With dead ends: 384 [2019-11-15 21:34:57,446 INFO L226 Difference]: Without dead ends: 218 [2019-11-15 21:34:57,448 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 21:34:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-15 21:34:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-15 21:34:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 21:34:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-15 21:34:57,489 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-15 21:34:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:57,490 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-15 21:34:57,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-15 21:34:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:34:57,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:57,495 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, 1, 1] [2019-11-15 21:34:57,496 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-11-15 21:34:57,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:57,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664938613] [2019-11-15 21:34:57,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:57,623 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 21:34:57,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664938613] [2019-11-15 21:34:57,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:57,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:57,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831360955] [2019-11-15 21:34:57,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:57,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:57,631 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-15 21:34:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:57,842 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-15 21:34:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:57,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-15 21:34:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:57,845 INFO L225 Difference]: With dead ends: 448 [2019-11-15 21:34:57,845 INFO L226 Difference]: Without dead ends: 243 [2019-11-15 21:34:57,847 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 21:34:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-15 21:34:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-15 21:34:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-15 21:34:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-15 21:34:57,865 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-15 21:34:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:57,866 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-15 21:34:57,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-15 21:34:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 21:34:57,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:57,871 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, 1] [2019-11-15 21:34:57,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-11-15 21:34:57,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:57,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386804228] [2019-11-15 21:34:57,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:57,952 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 21:34:57,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386804228] [2019-11-15 21:34:57,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:57,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:57,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667423082] [2019-11-15 21:34:57,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:57,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:57,956 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-15 21:34:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:58,188 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-15 21:34:58,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:58,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 21:34:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:58,194 INFO L225 Difference]: With dead ends: 525 [2019-11-15 21:34:58,194 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 21:34:58,195 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 21:34:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 21:34:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-15 21:34:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-15 21:34:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-15 21:34:58,212 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-15 21:34:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:58,212 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-15 21:34:58,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-15 21:34:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:34:58,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:58,216 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, 1, 1] [2019-11-15 21:34:58,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-11-15 21:34:58,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:58,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316018273] [2019-11-15 21:34:58,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:58,257 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 21:34:58,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316018273] [2019-11-15 21:34:58,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:58,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:58,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769678606] [2019-11-15 21:34:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:58,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:58,259 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-15 21:34:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:58,414 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-15 21:34:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:58,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-15 21:34:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:58,416 INFO L225 Difference]: With dead ends: 580 [2019-11-15 21:34:58,417 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 21:34:58,417 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 21:34:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 21:34:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-15 21:34:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 21:34:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-15 21:34:58,430 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-15 21:34:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:58,430 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-15 21:34:58,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-15 21:34:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:34:58,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:58,433 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, 1] [2019-11-15 21:34:58,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-11-15 21:34:58,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:58,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619404443] [2019-11-15 21:34:58,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:58,524 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 21:34:58,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619404443] [2019-11-15 21:34:58,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:58,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:58,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418258256] [2019-11-15 21:34:58,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:58,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:58,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:58,526 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-15 21:34:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:58,710 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-15 21:34:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:58,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-15 21:34:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:58,713 INFO L225 Difference]: With dead ends: 597 [2019-11-15 21:34:58,713 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 21:34:58,714 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 21:34:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 21:34:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-15 21:34:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 21:34:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-15 21:34:58,732 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-15 21:34:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:58,732 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-15 21:34:58,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-15 21:34:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:34:58,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:58,743 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, 1, 1] [2019-11-15 21:34:58,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:58,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-11-15 21:34:58,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:58,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104133125] [2019-11-15 21:34:58,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:58,799 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 21:34:58,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104133125] [2019-11-15 21:34:58,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:58,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:58,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145259222] [2019-11-15 21:34:58,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:58,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:58,801 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-15 21:34:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:58,920 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-15 21:34:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-15 21:34:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:58,923 INFO L225 Difference]: With dead ends: 591 [2019-11-15 21:34:58,923 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 21:34:58,924 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 21:34:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 21:34:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-15 21:34:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 21:34:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-15 21:34:58,934 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-15 21:34:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:58,935 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-15 21:34:58,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-15 21:34:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:34:58,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:58,936 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, 1, 1, 1] [2019-11-15 21:34:58,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-11-15 21:34:58,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:58,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120051343] [2019-11-15 21:34:58,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:58,973 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 21:34:58,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120051343] [2019-11-15 21:34:58,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:58,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:58,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554978616] [2019-11-15 21:34:58,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:58,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:58,975 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-15 21:34:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:59,088 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-15 21:34:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:59,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 21:34:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:59,091 INFO L225 Difference]: With dead ends: 598 [2019-11-15 21:34:59,091 INFO L226 Difference]: Without dead ends: 307 [2019-11-15 21:34:59,091 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 21:34:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-15 21:34:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-15 21:34:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-15 21:34:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-15 21:34:59,102 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-15 21:34:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:59,102 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-15 21:34:59,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-15 21:34:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:34:59,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:59,104 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, 1, 1] [2019-11-15 21:34:59,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-11-15 21:34:59,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:59,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790026221] [2019-11-15 21:34:59,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:59,156 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 21:34:59,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790026221] [2019-11-15 21:34:59,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:59,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:59,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953308973] [2019-11-15 21:34:59,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:59,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:59,158 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-15 21:34:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:59,311 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-15 21:34:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:59,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 21:34:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:59,314 INFO L225 Difference]: With dead ends: 638 [2019-11-15 21:34:59,314 INFO L226 Difference]: Without dead ends: 338 [2019-11-15 21:34:59,314 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 21:34:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-15 21:34:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-15 21:34:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-15 21:34:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-15 21:34:59,327 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-15 21:34:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:59,328 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-15 21:34:59,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-15 21:34:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:34:59,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:59,330 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, 1, 1] [2019-11-15 21:34:59,330 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-11-15 21:34:59,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:59,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575724811] [2019-11-15 21:34:59,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:59,368 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 21:34:59,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575724811] [2019-11-15 21:34:59,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:59,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:59,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336362079] [2019-11-15 21:34:59,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:59,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:59,371 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-15 21:34:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:59,538 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-15 21:34:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:59,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-15 21:34:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:59,541 INFO L225 Difference]: With dead ends: 667 [2019-11-15 21:34:59,541 INFO L226 Difference]: Without dead ends: 338 [2019-11-15 21:34:59,542 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 21:34:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-15 21:34:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-15 21:34:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-15 21:34:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-15 21:34:59,554 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-15 21:34:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:59,554 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-15 21:34:59,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-15 21:34:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:34:59,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:59,556 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, 1, 1] [2019-11-15 21:34:59,556 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-11-15 21:34:59,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:59,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925250661] [2019-11-15 21:34:59,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:59,596 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 21:34:59,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925250661] [2019-11-15 21:34:59,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:59,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:59,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417436746] [2019-11-15 21:34:59,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:59,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:59,598 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-15 21:34:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:59,763 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-15 21:34:59,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:59,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-15 21:34:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:59,766 INFO L225 Difference]: With dead ends: 700 [2019-11-15 21:34:59,767 INFO L226 Difference]: Without dead ends: 371 [2019-11-15 21:34:59,767 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 21:34:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-15 21:34:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-15 21:34:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-15 21:34:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-15 21:34:59,781 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-15 21:34:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:59,781 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-15 21:34:59,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-15 21:34:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 21:34:59,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:59,783 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, 1, 1] [2019-11-15 21:34:59,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-11-15 21:34:59,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:59,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452155302] [2019-11-15 21:34:59,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:59,815 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 21:34:59,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452155302] [2019-11-15 21:34:59,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:59,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:34:59,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377912805] [2019-11-15 21:34:59,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:59,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:59,818 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-15 21:34:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:59,978 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-15 21:34:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:59,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-15 21:34:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:59,981 INFO L225 Difference]: With dead ends: 727 [2019-11-15 21:34:59,981 INFO L226 Difference]: Without dead ends: 371 [2019-11-15 21:34:59,982 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 21:34:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-15 21:34:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-15 21:34:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-15 21:34:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-15 21:34:59,994 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-15 21:34:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:59,994 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-15 21:34:59,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-15 21:34:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:34:59,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:59,996 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, 1] [2019-11-15 21:34:59,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-11-15 21:34:59,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:59,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205592317] [2019-11-15 21:34:59,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:59,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:00,023 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 21:35:00,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205592317] [2019-11-15 21:35:00,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:00,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:00,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080878153] [2019-11-15 21:35:00,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:00,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:00,025 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-15 21:35:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:00,178 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-15 21:35:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:00,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 21:35:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:00,182 INFO L225 Difference]: With dead ends: 744 [2019-11-15 21:35:00,182 INFO L226 Difference]: Without dead ends: 388 [2019-11-15 21:35:00,183 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 21:35:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-15 21:35:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-15 21:35:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-15 21:35:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-15 21:35:00,198 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-15 21:35:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:00,199 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-15 21:35:00,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-15 21:35:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 21:35:00,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:00,201 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, 1] [2019-11-15 21:35:00,201 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-11-15 21:35:00,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:00,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057972420] [2019-11-15 21:35:00,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:00,233 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 21:35:00,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057972420] [2019-11-15 21:35:00,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:00,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:00,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332687324] [2019-11-15 21:35:00,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:00,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:00,235 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-15 21:35:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:00,395 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-15 21:35:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:00,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 21:35:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:00,398 INFO L225 Difference]: With dead ends: 765 [2019-11-15 21:35:00,398 INFO L226 Difference]: Without dead ends: 388 [2019-11-15 21:35:00,399 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 21:35:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-15 21:35:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-15 21:35:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-15 21:35:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-15 21:35:00,415 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-15 21:35:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:00,415 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-15 21:35:00,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-15 21:35:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 21:35:00,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:00,417 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, 1] [2019-11-15 21:35:00,417 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-11-15 21:35:00,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:00,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467961438] [2019-11-15 21:35:00,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:35:00,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467961438] [2019-11-15 21:35:00,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:00,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:00,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911409674] [2019-11-15 21:35:00,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:00,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:00,465 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-15 21:35:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:00,524 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-15 21:35:00,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:00,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 21:35:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:00,530 INFO L225 Difference]: With dead ends: 1092 [2019-11-15 21:35:00,530 INFO L226 Difference]: Without dead ends: 715 [2019-11-15 21:35:00,531 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 21:35:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-15 21:35:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-15 21:35:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-15 21:35:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-15 21:35:00,565 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-15 21:35:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-15 21:35:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-15 21:35:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 21:35:00,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:00,569 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, 1] [2019-11-15 21:35:00,570 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-11-15 21:35:00,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:00,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356140761] [2019-11-15 21:35:00,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:00,628 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 21:35:00,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356140761] [2019-11-15 21:35:00,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:00,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:00,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007199926] [2019-11-15 21:35:00,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:00,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:00,644 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-11-15 21:35:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:00,700 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-11-15 21:35:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:00,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 21:35:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:00,706 INFO L225 Difference]: With dead ends: 1798 [2019-11-15 21:35:00,706 INFO L226 Difference]: Without dead ends: 1090 [2019-11-15 21:35:00,708 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 21:35:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-11-15 21:35:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-11-15 21:35:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-15 21:35:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-11-15 21:35:00,746 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-11-15 21:35:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:00,747 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-11-15 21:35:00,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-11-15 21:35:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 21:35:00,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:00,750 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, 1] [2019-11-15 21:35:00,750 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:00,751 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-11-15 21:35:00,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:00,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874093410] [2019-11-15 21:35:00,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:00,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:00,787 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 21:35:00,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874093410] [2019-11-15 21:35:00,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:00,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:00,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683569150] [2019-11-15 21:35:00,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:00,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:00,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:00,789 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-11-15 21:35:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:00,998 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-11-15 21:35:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:00,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 21:35:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:01,006 INFO L225 Difference]: With dead ends: 2299 [2019-11-15 21:35:01,006 INFO L226 Difference]: Without dead ends: 1216 [2019-11-15 21:35:01,008 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 21:35:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-15 21:35:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-11-15 21:35:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-15 21:35:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-11-15 21:35:01,055 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-11-15 21:35:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:01,056 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-11-15 21:35:01,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-11-15 21:35:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 21:35:01,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:01,059 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, 1] [2019-11-15 21:35:01,059 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-11-15 21:35:01,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:01,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20188785] [2019-11-15 21:35:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:01,096 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 21:35:01,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20188785] [2019-11-15 21:35:01,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:01,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:01,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760273520] [2019-11-15 21:35:01,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:01,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:01,098 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-11-15 21:35:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:01,300 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-11-15 21:35:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:01,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 21:35:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:01,309 INFO L225 Difference]: With dead ends: 2413 [2019-11-15 21:35:01,309 INFO L226 Difference]: Without dead ends: 1210 [2019-11-15 21:35:01,311 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 21:35:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-15 21:35:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-11-15 21:35:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-11-15 21:35:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-11-15 21:35:01,367 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-11-15 21:35:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:01,368 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-11-15 21:35:01,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-11-15 21:35:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 21:35:01,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:01,372 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, 1] [2019-11-15 21:35:01,372 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:01,373 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-11-15 21:35:01,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:01,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235670053] [2019-11-15 21:35:01,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:01,419 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 21:35:01,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235670053] [2019-11-15 21:35:01,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:01,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:01,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623256459] [2019-11-15 21:35:01,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:01,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:01,422 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-11-15 21:35:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:01,629 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-11-15 21:35:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:01,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-15 21:35:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:01,637 INFO L225 Difference]: With dead ends: 2503 [2019-11-15 21:35:01,637 INFO L226 Difference]: Without dead ends: 1312 [2019-11-15 21:35:01,639 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 21:35:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-15 21:35:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-11-15 21:35:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-11-15 21:35:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-11-15 21:35:01,690 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-11-15 21:35:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:01,691 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-11-15 21:35:01,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-11-15 21:35:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:35:01,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:01,695 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, 1] [2019-11-15 21:35:01,695 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-11-15 21:35:01,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:01,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143038321] [2019-11-15 21:35:01,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:01,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:01,766 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 21:35:01,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143038321] [2019-11-15 21:35:01,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:01,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:01,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729625217] [2019-11-15 21:35:01,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:01,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:01,768 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-11-15 21:35:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:01,945 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-11-15 21:35:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:01,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-15 21:35:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:01,953 INFO L225 Difference]: With dead ends: 2611 [2019-11-15 21:35:01,953 INFO L226 Difference]: Without dead ends: 1306 [2019-11-15 21:35:01,955 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 21:35:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-15 21:35:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-11-15 21:35:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-11-15 21:35:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-11-15 21:35:02,000 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-11-15 21:35:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:02,001 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-11-15 21:35:02,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-11-15 21:35:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 21:35:02,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:02,005 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, 1] [2019-11-15 21:35:02,005 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-11-15 21:35:02,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:02,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078956197] [2019-11-15 21:35:02,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:02,062 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 21:35:02,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078956197] [2019-11-15 21:35:02,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:02,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:02,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995399002] [2019-11-15 21:35:02,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:02,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:02,069 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-11-15 21:35:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:02,258 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-11-15 21:35:02,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:02,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-15 21:35:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:02,266 INFO L225 Difference]: With dead ends: 2701 [2019-11-15 21:35:02,267 INFO L226 Difference]: Without dead ends: 1408 [2019-11-15 21:35:02,268 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 21:35:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-11-15 21:35:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-11-15 21:35:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-11-15 21:35:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-11-15 21:35:02,317 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-11-15 21:35:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:02,317 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-11-15 21:35:02,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-11-15 21:35:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 21:35:02,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:02,322 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, 1] [2019-11-15 21:35:02,322 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-11-15 21:35:02,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:02,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454188688] [2019-11-15 21:35:02,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:02,377 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 21:35:02,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454188688] [2019-11-15 21:35:02,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:02,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:02,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473852392] [2019-11-15 21:35:02,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:02,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:02,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:02,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:02,380 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-11-15 21:35:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:02,563 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-11-15 21:35:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:02,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-15 21:35:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:02,573 INFO L225 Difference]: With dead ends: 2803 [2019-11-15 21:35:02,573 INFO L226 Difference]: Without dead ends: 1402 [2019-11-15 21:35:02,575 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 21:35:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-11-15 21:35:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-11-15 21:35:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-15 21:35:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-11-15 21:35:02,626 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-11-15 21:35:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:02,626 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-11-15 21:35:02,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-11-15 21:35:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 21:35:02,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:02,632 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, 1, 1] [2019-11-15 21:35:02,632 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-11-15 21:35:02,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:02,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176436352] [2019-11-15 21:35:02,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:02,741 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 21:35:02,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176436352] [2019-11-15 21:35:02,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:02,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:02,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38456687] [2019-11-15 21:35:02,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:02,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:02,744 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-11-15 21:35:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:02,923 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-11-15 21:35:02,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:02,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 21:35:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:02,932 INFO L225 Difference]: With dead ends: 2899 [2019-11-15 21:35:02,932 INFO L226 Difference]: Without dead ends: 1510 [2019-11-15 21:35:02,934 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 21:35:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-15 21:35:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-15 21:35:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-15 21:35:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-11-15 21:35:02,984 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-11-15 21:35:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:02,984 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-11-15 21:35:02,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-11-15 21:35:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 21:35:02,989 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:02,989 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, 1, 1] [2019-11-15 21:35:02,989 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-11-15 21:35:02,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:02,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943784389] [2019-11-15 21:35:02,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:02,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:03,057 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 21:35:03,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943784389] [2019-11-15 21:35:03,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:03,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:03,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788655037] [2019-11-15 21:35:03,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:03,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:03,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:03,060 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-11-15 21:35:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:03,229 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-11-15 21:35:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:03,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-15 21:35:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:03,238 INFO L225 Difference]: With dead ends: 2974 [2019-11-15 21:35:03,239 INFO L226 Difference]: Without dead ends: 1510 [2019-11-15 21:35:03,242 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 21:35:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-15 21:35:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-15 21:35:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-15 21:35:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-11-15 21:35:03,291 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-11-15 21:35:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:03,292 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-11-15 21:35:03,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-11-15 21:35:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 21:35:03,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:03,297 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, 1] [2019-11-15 21:35:03,297 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-11-15 21:35:03,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:03,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113116243] [2019-11-15 21:35:03,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:03,364 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 21:35:03,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113116243] [2019-11-15 21:35:03,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:03,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:03,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345769276] [2019-11-15 21:35:03,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:03,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:03,366 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-11-15 21:35:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:03,537 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-11-15 21:35:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:03,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-15 21:35:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:03,547 INFO L225 Difference]: With dead ends: 2947 [2019-11-15 21:35:03,547 INFO L226 Difference]: Without dead ends: 1483 [2019-11-15 21:35:03,549 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 21:35:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-11-15 21:35:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-11-15 21:35:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-15 21:35:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-11-15 21:35:03,598 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-11-15 21:35:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:03,599 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-11-15 21:35:03,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-11-15 21:35:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 21:35:03,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:03,603 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, 1] [2019-11-15 21:35:03,603 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-11-15 21:35:03,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:03,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113693803] [2019-11-15 21:35:03,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:03,707 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 21:35:03,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113693803] [2019-11-15 21:35:03,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:03,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:03,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436955899] [2019-11-15 21:35:03,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:03,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:03,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:03,709 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-11-15 21:35:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:03,870 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-11-15 21:35:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:03,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-15 21:35:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:03,879 INFO L225 Difference]: With dead ends: 2947 [2019-11-15 21:35:03,879 INFO L226 Difference]: Without dead ends: 1456 [2019-11-15 21:35:03,882 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 21:35:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-15 21:35:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-11-15 21:35:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-15 21:35:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-11-15 21:35:03,931 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-11-15 21:35:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:03,931 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-11-15 21:35:03,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-11-15 21:35:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 21:35:03,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:03,936 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, 1, 1] [2019-11-15 21:35:03,936 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-11-15 21:35:03,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:03,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195111057] [2019-11-15 21:35:03,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:03,998 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 21:35:03,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195111057] [2019-11-15 21:35:03,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:03,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:03,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080331594] [2019-11-15 21:35:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:04,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:04,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:04,001 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-11-15 21:35:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:04,165 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-11-15 21:35:04,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:04,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-15 21:35:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:04,174 INFO L225 Difference]: With dead ends: 2962 [2019-11-15 21:35:04,174 INFO L226 Difference]: Without dead ends: 1525 [2019-11-15 21:35:04,176 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 21:35:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-11-15 21:35:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-11-15 21:35:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-15 21:35:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-11-15 21:35:04,226 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-11-15 21:35:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:04,226 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-11-15 21:35:04,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-11-15 21:35:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 21:35:04,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:04,231 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, 1, 1] [2019-11-15 21:35:04,231 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-11-15 21:35:04,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:04,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337154795] [2019-11-15 21:35:04,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:04,292 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 21:35:04,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337154795] [2019-11-15 21:35:04,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:04,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:04,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888388699] [2019-11-15 21:35:04,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:04,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:04,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:04,294 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-11-15 21:35:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:04,443 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-11-15 21:35:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:04,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-15 21:35:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:04,452 INFO L225 Difference]: With dead ends: 3031 [2019-11-15 21:35:04,452 INFO L226 Difference]: Without dead ends: 1513 [2019-11-15 21:35:04,454 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 21:35:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-15 21:35:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-11-15 21:35:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-15 21:35:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-11-15 21:35:04,506 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-11-15 21:35:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:04,506 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-11-15 21:35:04,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-11-15 21:35:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-15 21:35:04,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:04,511 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, 1, 1] [2019-11-15 21:35:04,511 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-11-15 21:35:04,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:04,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403571338] [2019-11-15 21:35:04,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-11-15 21:35:04,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403571338] [2019-11-15 21:35:04,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:04,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:04,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147214747] [2019-11-15 21:35:04,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:04,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:04,625 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-11-15 21:35:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:04,693 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-11-15 21:35:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:04,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-15 21:35:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:04,711 INFO L225 Difference]: With dead ends: 3052 [2019-11-15 21:35:04,716 INFO L226 Difference]: Without dead ends: 1558 [2019-11-15 21:35:04,718 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 21:35:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-15 21:35:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-11-15 21:35:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-15 21:35:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-11-15 21:35:04,811 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-11-15 21:35:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:04,812 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-11-15 21:35:04,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-11-15 21:35:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-15 21:35:04,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:04,817 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, 1, 1] [2019-11-15 21:35:04,817 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-11-15 21:35:04,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:04,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599921258] [2019-11-15 21:35:04,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-11-15 21:35:04,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599921258] [2019-11-15 21:35:04,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:04,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:35:04,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362407913] [2019-11-15 21:35:04,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:04,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:04,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:04,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:04,889 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-11-15 21:35:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:04,940 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-11-15 21:35:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:04,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-15 21:35:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:04,955 INFO L225 Difference]: With dead ends: 3142 [2019-11-15 21:35:04,955 INFO L226 Difference]: Without dead ends: 1591 [2019-11-15 21:35:04,957 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 21:35:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-11-15 21:35:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-11-15 21:35:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-15 21:35:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-11-15 21:35:05,011 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-11-15 21:35:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:05,011 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-11-15 21:35:05,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-11-15 21:35:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-15 21:35:05,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:05,017 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:05,018 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:05,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-11-15 21:35:05,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:05,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043042878] [2019-11-15 21:35:05,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-15 21:35:05,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043042878] [2019-11-15 21:35:05,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:05,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:05,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594755191] [2019-11-15 21:35:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:05,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:05,152 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-11-15 21:35:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:05,234 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-11-15 21:35:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:05,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-15 21:35:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:05,240 INFO L225 Difference]: With dead ends: 4612 [2019-11-15 21:35:05,240 INFO L226 Difference]: Without dead ends: 3061 [2019-11-15 21:35:05,243 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 21:35:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-15 21:35:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-11-15 21:35:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-11-15 21:35:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-11-15 21:35:05,349 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-11-15 21:35:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:05,349 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-11-15 21:35:05,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-11-15 21:35:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 21:35:05,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:05,357 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, 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 21:35:05,358 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-11-15 21:35:05,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:05,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312164976] [2019-11-15 21:35:05,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-15 21:35:05,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312164976] [2019-11-15 21:35:05,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:05,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:05,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133547905] [2019-11-15 21:35:05,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:05,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:05,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:05,497 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-11-15 21:35:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:05,688 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-11-15 21:35:05,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:05,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-15 21:35:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:05,693 INFO L225 Difference]: With dead ends: 6291 [2019-11-15 21:35:05,693 INFO L226 Difference]: Without dead ends: 2043 [2019-11-15 21:35:05,698 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 21:35:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-11-15 21:35:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-11-15 21:35:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-15 21:35:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-11-15 21:35:05,759 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-11-15 21:35:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:05,760 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-11-15 21:35:05,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-11-15 21:35:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-15 21:35:05,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:05,767 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, 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 21:35:05,767 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-11-15 21:35:05,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:05,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471705880] [2019-11-15 21:35:05,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:05,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-11-15 21:35:05,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471705880] [2019-11-15 21:35:05,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763637948] [2019-11-15 21:35:05,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/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 21:35:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:06,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:35:06,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-15 21:35:06,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:35:06,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 21:35:06,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897691436] [2019-11-15 21:35:06,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:06,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:06,247 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 3 states. [2019-11-15 21:35:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:06,357 INFO L93 Difference]: Finished difference Result 4660 states and 6632 transitions. [2019-11-15 21:35:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:06,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-15 21:35:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:06,363 INFO L225 Difference]: With dead ends: 4660 [2019-11-15 21:35:06,363 INFO L226 Difference]: Without dead ends: 2676 [2019-11-15 21:35:06,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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 21:35:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-11-15 21:35:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2019-11-15 21:35:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-11-15 21:35:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3798 transitions. [2019-11-15 21:35:06,467 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3798 transitions. Word has length 375 [2019-11-15 21:35:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:06,468 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3798 transitions. [2019-11-15 21:35:06,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3798 transitions. [2019-11-15 21:35:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-15 21:35:06,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:06,480 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:06,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:06,729 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:06,730 INFO L82 PathProgramCache]: Analyzing trace with hash 490258226, now seen corresponding path program 1 times [2019-11-15 21:35:06,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:06,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81828085] [2019-11-15 21:35:06,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:06,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:06,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-15 21:35:06,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81828085] [2019-11-15 21:35:06,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697636896] [2019-11-15 21:35:06,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/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 21:35:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:07,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:35:07,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-15 21:35:07,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:35:07,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 21:35:07,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714112502] [2019-11-15 21:35:07,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:07,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:07,317 INFO L87 Difference]: Start difference. First operand 2676 states and 3798 transitions. Second operand 3 states. [2019-11-15 21:35:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:07,375 INFO L93 Difference]: Finished difference Result 2736 states and 3882 transitions. [2019-11-15 21:35:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:07,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-11-15 21:35:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:07,380 INFO L225 Difference]: With dead ends: 2736 [2019-11-15 21:35:07,380 INFO L226 Difference]: Without dead ends: 2143 [2019-11-15 21:35:07,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 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 21:35:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-11-15 21:35:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2085. [2019-11-15 21:35:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-11-15 21:35:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2968 transitions. [2019-11-15 21:35:07,486 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2968 transitions. Word has length 446 [2019-11-15 21:35:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:07,487 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 2968 transitions. [2019-11-15 21:35:07,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2968 transitions. [2019-11-15 21:35:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-15 21:35:07,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:07,496 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:07,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:07,700 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash 567159024, now seen corresponding path program 1 times [2019-11-15 21:35:07,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:07,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141927513] [2019-11-15 21:35:07,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:07,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:07,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-15 21:35:07,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141927513] [2019-11-15 21:35:07,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191812383] [2019-11-15 21:35:07,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/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 21:35:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:08,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:35:08,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-15 21:35:08,178 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:08,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:35:08,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459495916] [2019-11-15 21:35:08,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:35:08,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:35:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:35:08,180 INFO L87 Difference]: Start difference. First operand 2085 states and 2968 transitions. Second operand 4 states. [2019-11-15 21:35:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:08,474 INFO L93 Difference]: Finished difference Result 4343 states and 6173 transitions. [2019-11-15 21:35:08,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:35:08,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2019-11-15 21:35:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:08,479 INFO L225 Difference]: With dead ends: 4343 [2019-11-15 21:35:08,479 INFO L226 Difference]: Without dead ends: 2221 [2019-11-15 21:35:08,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 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 21:35:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-11-15 21:35:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1935. [2019-11-15 21:35:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-15 21:35:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-15 21:35:08,580 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 446 [2019-11-15 21:35:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:08,581 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-15 21:35:08,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:35:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-15 21:35:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-15 21:35:08,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:08,617 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:08,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:08,822 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 260585257, now seen corresponding path program 1 times [2019-11-15 21:35:08,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:08,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597662460] [2019-11-15 21:35:08,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:08,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:08,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-15 21:35:09,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597662460] [2019-11-15 21:35:09,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799760202] [2019-11-15 21:35:09,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:09,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:35:09,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-15 21:35:10,172 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:10,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:35:10,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850014859] [2019-11-15 21:35:10,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:35:10,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:35:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:35:10,176 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 4 states. [2019-11-15 21:35:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:10,504 INFO L93 Difference]: Finished difference Result 4591 states and 6320 transitions. [2019-11-15 21:35:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:35:10,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-11-15 21:35:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:10,509 INFO L225 Difference]: With dead ends: 4591 [2019-11-15 21:35:10,509 INFO L226 Difference]: Without dead ends: 2601 [2019-11-15 21:35:10,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 849 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 21:35:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-11-15 21:35:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1935. [2019-11-15 21:35:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-15 21:35:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-15 21:35:10,585 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 847 [2019-11-15 21:35:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:10,586 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-15 21:35:10,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:35:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-15 21:35:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-11-15 21:35:10,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:10,626 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:10,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:10,831 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-11-15 21:35:10,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:10,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099873849] [2019-11-15 21:35:10,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:10,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-15 21:35:11,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099873849] [2019-11-15 21:35:11,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:11,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:11,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866494515] [2019-11-15 21:35:11,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:11,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:11,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:11,597 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-11-15 21:35:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:11,781 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-11-15 21:35:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:11,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-11-15 21:35:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:11,785 INFO L225 Difference]: With dead ends: 3871 [2019-11-15 21:35:11,785 INFO L226 Difference]: Without dead ends: 1975 [2019-11-15 21:35:11,788 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 21:35:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-11-15 21:35:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-11-15 21:35:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-15 21:35:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-11-15 21:35:11,856 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-11-15 21:35:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:11,857 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-11-15 21:35:11,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-11-15 21:35:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-15 21:35:11,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:11,897 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 21:35:11,897 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-11-15 21:35:11,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:11,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732102764] [2019-11-15 21:35:11,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:11,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-11-15 21:35:12,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732102764] [2019-11-15 21:35:12,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:12,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:12,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602252303] [2019-11-15 21:35:12,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:12,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:12,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:12,820 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-11-15 21:35:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:12,995 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-11-15 21:35:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:12,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-11-15 21:35:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:12,999 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 21:35:12,999 INFO L226 Difference]: Without dead ends: 1935 [2019-11-15 21:35:13,002 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 21:35:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-11-15 21:35:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-11-15 21:35:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-15 21:35:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-11-15 21:35:13,071 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-11-15 21:35:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:13,072 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-11-15 21:35:13,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-11-15 21:35:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-11-15 21:35:13,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:13,115 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:13,116 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-11-15 21:35:13,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:13,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318838314] [2019-11-15 21:35:13,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:13,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:13,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-11-15 21:35:13,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318838314] [2019-11-15 21:35:13,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:13,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:13,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411531081] [2019-11-15 21:35:13,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:13,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:13,931 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-11-15 21:35:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:14,138 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-11-15 21:35:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:14,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-11-15 21:35:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:14,143 INFO L225 Difference]: With dead ends: 3871 [2019-11-15 21:35:14,143 INFO L226 Difference]: Without dead ends: 1963 [2019-11-15 21:35:14,146 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 21:35:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-11-15 21:35:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-11-15 21:35:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-11-15 21:35:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-11-15 21:35:14,220 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-11-15 21:35:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:14,221 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-11-15 21:35:14,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-11-15 21:35:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-15 21:35:14,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:14,234 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 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] [2019-11-15 21:35:14,234 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:35:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-11-15 21:35:14,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:14,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387393526] [2019-11-15 21:35:14,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:14,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:14,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-11-15 21:35:15,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387393526] [2019-11-15 21:35:15,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:15,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:15,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013001238] [2019-11-15 21:35:15,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:15,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:15,117 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-11-15 21:35:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:15,270 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-11-15 21:35:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:15,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-15 21:35:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:15,271 INFO L225 Difference]: With dead ends: 2491 [2019-11-15 21:35:15,272 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:35:15,274 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 21:35:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:35:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:35:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:35:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:35:15,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-11-15 21:35:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:15,276 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:35:15,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:35:15,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:35:15,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:35:15,920 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 130 [2019-11-15 21:35:16,406 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 128 [2019-11-15 21:35:17,092 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 21:35:17,638 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 21:35:18,357 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-11-15 21:35:18,650 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-15 21:35:19,034 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-15 21:35:19,609 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-15 21:35:20,738 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-11-15 21:35:21,094 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-15 21:35:21,461 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 21:35:21,830 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 21:35:22,282 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-15 21:35:22,782 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 21:35:23,239 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-15 21:35:23,518 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-15 21:35:24,354 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-11-15 21:35:24,804 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-15 21:35:25,195 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-15 21:35:25,545 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-15 21:35:25,878 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-15 21:35:26,267 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-15 21:35:26,905 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-15 21:35:26,907 INFO L446 ceAbstractionStarter]: At program point L630(lines 621 632) the Hoare annotation is: true [2019-11-15 21:35:26,907 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-15 21:35:26,907 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-15 21:35:26,908 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 551) 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 21:35:26,908 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 583) 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 21:35:26,908 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 308) no Hoare annotation was computed. [2019-11-15 21:35:26,908 INFO L443 ceAbstractionStarter]: For program point L301-2(lines 301 308) no Hoare annotation was computed. [2019-11-15 21:35:26,908 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 549) no Hoare annotation was computed. [2019-11-15 21:35:26,908 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 560) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 571) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 582) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 540) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 534 540) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 360) no Hoare annotation was computed. [2019-11-15 21:35:26,909 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 21:35:26,909 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 561) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-15 21:35:26,910 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 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 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))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (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 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse12 .cse11) .cse13) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse11) .cse13))) [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 273) no Hoare annotation was computed. [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L271-2(lines 207 546) no Hoare annotation was computed. [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 250) no Hoare annotation was computed. [2019-11-15 21:35:26,910 INFO L439 ceAbstractionStarter]: At program point L206(lines 205 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 559) no Hoare annotation was computed. [2019-11-15 21:35:26,910 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 570) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 581) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L446 ceAbstractionStarter]: At program point L603(lines 97 604) the Hoare annotation is: true [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L340-2(lines 340 344) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L374(lines 374 406) no Hoare annotation was computed. [2019-11-15 21:35:26,911 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 558) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 569) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 580) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L443 ceAbstractionStarter]: For program point L474-2(lines 207 546) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-15 21:35:26,912 INFO L439 ceAbstractionStarter]: At program point L210(lines 104 582) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~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)) (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 21:35:26,913 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 559) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,913 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 570) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11)) (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 21:35:26,913 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-15 21:35:26,913 INFO L443 ceAbstractionStarter]: For program point L608(lines 608 610) no Hoare annotation was computed. [2019-11-15 21:35:26,915 INFO L443 ceAbstractionStarter]: For program point L608-2(lines 608 610) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 557) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 568) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 579) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L446 ceAbstractionStarter]: At program point L611(lines 11 615) the Hoare annotation is: true [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 556) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 567) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-15 21:35:26,916 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 578) no Hoare annotation was computed. [2019-11-15 21:35:26,917 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 519) no Hoare annotation was computed. [2019-11-15 21:35:26,917 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-15 21:35:26,917 INFO L443 ceAbstractionStarter]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-15 21:35:26,917 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 356) no Hoare annotation was computed. [2019-11-15 21:35:26,917 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 557) 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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 .cse9 .cse8 (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 21:35:26,917 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 568) 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,918 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-15 21:35:26,918 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-15 21:35:26,918 INFO L439 ceAbstractionStarter]: At program point L547(lines 98 602) the Hoare annotation is: (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse13 .cse14) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13 (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)) .cse14 .cse8) (and (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 21:35:26,919 INFO L439 ceAbstractionStarter]: At program point L349(lines 324 367) 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,919 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 418) no Hoare annotation was computed. [2019-11-15 21:35:26,919 INFO L439 ceAbstractionStarter]: At program point L383(lines 374 406) 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,919 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:35:26,920 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 286) no Hoare annotation was computed. [2019-11-15 21:35:26,920 INFO L443 ceAbstractionStarter]: For program point L284-2(lines 207 546) no Hoare annotation was computed. [2019-11-15 21:35:26,920 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 555) no Hoare annotation was computed. [2019-11-15 21:35:26,921 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 566) no Hoare annotation was computed. [2019-11-15 21:35:26,921 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 577) no Hoare annotation was computed. [2019-11-15 21:35:26,921 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-11-15 21:35:26,921 INFO L439 ceAbstractionStarter]: At program point L516-1(lines 207 546) 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 21:35:26,921 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-15 21:35:26,921 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 322) no Hoare annotation was computed. [2019-11-15 21:35:26,922 INFO L443 ceAbstractionStarter]: For program point L318-2(lines 207 546) no Hoare annotation was computed. [2019-11-15 21:35:26,922 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 578) 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))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (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 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 21:35:26,922 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-15 21:35:26,922 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 600) no Hoare annotation was computed. [2019-11-15 21:35:26,922 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 404) no Hoare annotation was computed. [2019-11-15 21:35:26,922 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 554) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 565) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 576) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 72 614) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 599) no Hoare annotation was computed. [2019-11-15 21:35:26,923 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-11-15 21:35:26,924 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 555) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,924 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 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 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,924 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 576) 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 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L586-2(lines 585 599) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-11-15 21:35:26,925 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 290 294) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 553) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 564) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 575) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 590) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 232) no Hoare annotation was computed. [2019-11-15 21:35:26,926 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 225 232) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 433) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L425-2(lines 425 433) no Hoare annotation was computed. [2019-11-15 21:35:26,927 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-15 21:35:26,928 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 552) no Hoare annotation was computed. [2019-11-15 21:35:26,928 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 563) no Hoare annotation was computed. [2019-11-15 21:35:26,928 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 574) no Hoare annotation was computed. [2019-11-15 21:35:26,928 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 366) no Hoare annotation was computed. [2019-11-15 21:35:26,928 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 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 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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-11-15 21:35:26,929 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 564) 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 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,929 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-11-15 21:35:26,929 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-15 21:35:26,929 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 404) 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 21:35:26,929 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 551) no Hoare annotation was computed. [2019-11-15 21:35:26,930 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 562) no Hoare annotation was computed. [2019-11-15 21:35:26,930 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 573) no Hoare annotation was computed. [2019-11-15 21:35:26,930 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 602) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse0 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse17 .cse18) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse17 (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)) .cse18 .cse8) (and (and .cse1 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 21:35:26,930 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 365) no Hoare annotation was computed. [2019-11-15 21:35:26,930 INFO L443 ceAbstractionStarter]: For program point L330-1(lines 330 365) no Hoare annotation was computed. [2019-11-15 21:35:26,931 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 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 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))) (.cse13 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.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 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= 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) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2019-11-15 21:35:26,931 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 575) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12 .cse13 .cse14 .cse15)) (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)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (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)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse12 .cse13 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse14 .cse15) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-15 21:35:26,931 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 21:35:26,932 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-15 21:35:26,932 INFO L443 ceAbstractionStarter]: For program point L496-2(lines 207 546) no Hoare annotation was computed. [2019-11-15 21:35:26,932 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 362) no Hoare annotation was computed. [2019-11-15 21:35:26,933 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-15 21:35:26,933 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2019-11-15 21:35:26,933 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 550) no Hoare annotation was computed. [2019-11-15 21:35:26,933 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 561) no Hoare annotation was computed. [2019-11-15 21:35:26,934 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 572) no Hoare annotation was computed. [2019-11-15 21:35:26,934 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 583) no Hoare annotation was computed. [2019-11-15 21:35:26,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:35:26 BoogieIcfgContainer [2019-11-15 21:35:26,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:35:26,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:35:26,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:35:26,997 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:35:26,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:56" (3/4) ... [2019-11-15 21:35:27,000 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:35:27,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:35:27,025 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:35:27,211 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f174d560-ea13-4767-8100-c04d6f3eb57c/bin/uautomizer/witness.graphml [2019-11-15 21:35:27,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:35:27,212 INFO L168 Benchmark]: Toolchain (without parser) took 32247.41 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 947.4 MB in the beginning and 1.4 GB in the end (delta: -446.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 21:35:27,213 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:35:27,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:35:27,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:35:27,214 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 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 21:35:27,214 INFO L168 Benchmark]: RCFGBuilder took 838.13 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 21:35:27,215 INFO L168 Benchmark]: TraceAbstraction took 30648.88 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -366.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 21:35:27,216 INFO L168 Benchmark]: Witness Printer took 214.44 ms. Allocated memory is still 2.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:35:27,222 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.65 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 838.13 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 30648.88 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -366.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 214.44 ms. Allocated memory is still 2.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 618]: 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: (8448 <= s__state && ((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(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 == 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: (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(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: 104]: Loop Invariant Derived loop invariant: (s__state <= 8448 && !(s__state == 8448) && 2 == blastFlag) || ((((((((((((((((((((((((((!(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: 621]: 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: 374]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: 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)) || ((((((((((((((!(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)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) && 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 == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(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) && 2 == blastFlag)) || (((((((((((((((!(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)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (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)) || ((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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 == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: 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 == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && !(0 == s__hit)) || (((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(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 == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 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)) && 2 == blastFlag) && !(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)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((8448 <= s__state && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(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) && 2 == blastFlag)) || (((((((((((((((!(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)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 207]: 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: 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: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(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: 386]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: 146]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: (((((((((((((((((((((((((!(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 == 8544)) && !(s__state == 8529)) && !(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)) && 2 == blastFlag) && !(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: (((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)) && blastFlag == 1) && !(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))) || ((((((((((((((((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)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: SAFE, OverallTime: 30.5s, OverallIterations: 40, TraceHistogramMax: 38, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, HoareTripleCheckerStatistics: 6725 SDtfs, 5197 SDslu, 2367 SDs, 0 SdLazy, 3349 SolverSat, 1340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4045 HoareAnnotationTreeSize, 28 FomulaSimplifications, 34973 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7512 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 13262 NumberOfCodeBlocks, 13262 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177165 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3245 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 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...