./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8822f5291178e45ba1da62c4d4636880280d6cc4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:31:55,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:31:55,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:31:55,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:31:55,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:31:55,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:31:55,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:31:55,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:31:55,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:31:55,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:31:55,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:31:55,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:31:55,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:31:55,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:31:55,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:31:55,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:31:55,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:31:55,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:31:55,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:31:55,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:31:55,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:31:55,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:31:55,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:31:55,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:31:55,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:31:55,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:31:55,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:31:55,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:31:55,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:31:55,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:31:55,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:31:55,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:31:55,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:31:55,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:31:55,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:31:55,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:31:55,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:31:55,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:31:55,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:31:55,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:31:55,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:31:55,538 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 17:31:55,561 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:31:55,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:31:55,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:31:55,563 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:31:55,563 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:31:55,563 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:31:55,563 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:31:55,563 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:31:55,564 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:31:55,564 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:31:55,564 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:31:55,564 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:31:55,564 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:31:55,564 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:31:55,565 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:31:55,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 17:31:55,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:31:55,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 17:31:55,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:31:55,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:31:55,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:31:55,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:31:55,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:31:55,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:31:55,570 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8822f5291178e45ba1da62c4d4636880280d6cc4 [2020-12-09 17:31:55,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:31:55,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:31:55,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:31:55,792 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:31:55,792 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:31:55,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-12-09 17:31:55,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/data/79d537940/f7a381d03b3742a4b10a83ad71abdf84/FLAG6d4003350 [2020-12-09 17:31:56,218 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:31:56,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-12-09 17:31:56,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/data/79d537940/f7a381d03b3742a4b10a83ad71abdf84/FLAG6d4003350 [2020-12-09 17:31:56,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/data/79d537940/f7a381d03b3742a4b10a83ad71abdf84 [2020-12-09 17:31:56,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:31:56,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:31:56,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:56,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:31:56,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:31:56,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4e4587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56, skipping insertion in model container [2020-12-09 17:31:56,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:31:56,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:31:56,425 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49194,49207] [2020-12-09 17:31:56,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:56,437 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:31:56,489 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49194,49207] [2020-12-09 17:31:56,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:31:56,505 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:31:56,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56 WrapperNode [2020-12-09 17:31:56,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:31:56,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:56,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:31:56,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:31:56,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:31:56,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:31:56,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:31:56,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:31:56,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2020-12-09 17:31:56,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:31:56,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:31:56,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:31:56,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:31:56,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:31:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 17:31:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:31:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:31:56,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:31:56,756 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-09 17:31:57,134 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-12-09 17:31:57,134 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-12-09 17:31:57,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:31:57,438 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 17:31:57,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57 BoogieIcfgContainer [2020-12-09 17:31:57,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:31:57,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:31:57,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:31:57,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:31:57,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:31:56" (1/3) ... [2020-12-09 17:31:57,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b09b514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:57, skipping insertion in model container [2020-12-09 17:31:57,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (2/3) ... [2020-12-09 17:31:57,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b09b514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:57, skipping insertion in model container [2020-12-09 17:31:57,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57" (3/3) ... [2020-12-09 17:31:57,446 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2020-12-09 17:31:57,456 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:31:57,459 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 17:31:57,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 17:31:57,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:31:57,485 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 17:31:57,485 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:31:57,485 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:31:57,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:31:57,485 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:31:57,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:31:57,485 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:31:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2020-12-09 17:31:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 17:31:57,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:57,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:57,502 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 53983942, now seen corresponding path program 1 times [2020-12-09 17:31:57,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:57,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796990056] [2020-12-09 17:31:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:57,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796990056] [2020-12-09 17:31:57,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:57,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:57,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13399741] [2020-12-09 17:31:57,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:57,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:57,663 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2020-12-09 17:31:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:57,812 INFO L93 Difference]: Finished difference Result 257 states and 449 transitions. [2020-12-09 17:31:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:57,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-09 17:31:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:57,823 INFO L225 Difference]: With dead ends: 257 [2020-12-09 17:31:57,823 INFO L226 Difference]: Without dead ends: 134 [2020-12-09 17:31:57,826 INFO L677 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 [2020-12-09 17:31:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-09 17:31:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-12-09 17:31:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 17:31:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2020-12-09 17:31:57,867 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 21 [2020-12-09 17:31:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:57,867 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2020-12-09 17:31:57,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2020-12-09 17:31:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 17:31:57,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:57,869 INFO L422 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] [2020-12-09 17:31:57,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:31:57,869 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2017580179, now seen corresponding path program 1 times [2020-12-09 17:31:57,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:57,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764064193] [2020-12-09 17:31:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:57,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764064193] [2020-12-09 17:31:57,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:57,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:57,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653484769] [2020-12-09 17:31:57,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:57,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:57,924 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand 3 states. [2020-12-09 17:31:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,025 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2020-12-09 17:31:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 17:31:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,028 INFO L225 Difference]: With dead ends: 275 [2020-12-09 17:31:58,028 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 17:31:58,030 INFO L677 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 [2020-12-09 17:31:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 17:31:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2020-12-09 17:31:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-12-09 17:31:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2020-12-09 17:31:58,041 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 23 [2020-12-09 17:31:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,042 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2020-12-09 17:31:58,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2020-12-09 17:31:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 17:31:58,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,043 INFO L422 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] [2020-12-09 17:31:58,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 17:31:58,043 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1217402172, now seen corresponding path program 1 times [2020-12-09 17:31:58,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050336881] [2020-12-09 17:31:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050336881] [2020-12-09 17:31:58,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440198773] [2020-12-09 17:31:58,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,084 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand 3 states. [2020-12-09 17:31:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,171 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2020-12-09 17:31:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 17:31:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,173 INFO L225 Difference]: With dead ends: 286 [2020-12-09 17:31:58,173 INFO L226 Difference]: Without dead ends: 153 [2020-12-09 17:31:58,174 INFO L677 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 [2020-12-09 17:31:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-09 17:31:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2020-12-09 17:31:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-09 17:31:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2020-12-09 17:31:58,185 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 23 [2020-12-09 17:31:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,185 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2020-12-09 17:31:58,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2020-12-09 17:31:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 17:31:58,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,186 INFO L422 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] [2020-12-09 17:31:58,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 17:31:58,186 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1384534531, now seen corresponding path program 1 times [2020-12-09 17:31:58,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640139733] [2020-12-09 17:31:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640139733] [2020-12-09 17:31:58,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939161905] [2020-12-09 17:31:58,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,228 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 3 states. [2020-12-09 17:31:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,329 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2020-12-09 17:31:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 17:31:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,330 INFO L225 Difference]: With dead ends: 306 [2020-12-09 17:31:58,331 INFO L226 Difference]: Without dead ends: 157 [2020-12-09 17:31:58,331 INFO L677 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 [2020-12-09 17:31:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-09 17:31:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-12-09 17:31:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 17:31:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2020-12-09 17:31:58,339 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 23 [2020-12-09 17:31:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,339 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2020-12-09 17:31:58,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2020-12-09 17:31:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 17:31:58,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,340 INFO L422 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] [2020-12-09 17:31:58,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 17:31:58,340 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 499622890, now seen corresponding path program 1 times [2020-12-09 17:31:58,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52072160] [2020-12-09 17:31:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52072160] [2020-12-09 17:31:58,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387467108] [2020-12-09 17:31:58,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,369 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 3 states. [2020-12-09 17:31:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,458 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2020-12-09 17:31:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-09 17:31:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,460 INFO L225 Difference]: With dead ends: 320 [2020-12-09 17:31:58,460 INFO L226 Difference]: Without dead ends: 165 [2020-12-09 17:31:58,460 INFO L677 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 [2020-12-09 17:31:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-09 17:31:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-12-09 17:31:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 17:31:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2020-12-09 17:31:58,469 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 24 [2020-12-09 17:31:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,469 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2020-12-09 17:31:58,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2020-12-09 17:31:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 17:31:58,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,470 INFO L422 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] [2020-12-09 17:31:58,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 17:31:58,471 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1910945529, now seen corresponding path program 1 times [2020-12-09 17:31:58,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049879990] [2020-12-09 17:31:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049879990] [2020-12-09 17:31:58,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455923181] [2020-12-09 17:31:58,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,504 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand 3 states. [2020-12-09 17:31:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,580 INFO L93 Difference]: Finished difference Result 314 states and 476 transitions. [2020-12-09 17:31:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-09 17:31:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,582 INFO L225 Difference]: With dead ends: 314 [2020-12-09 17:31:58,582 INFO L226 Difference]: Without dead ends: 159 [2020-12-09 17:31:58,582 INFO L677 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 [2020-12-09 17:31:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-09 17:31:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2020-12-09 17:31:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 17:31:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2020-12-09 17:31:58,588 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2020-12-09 17:31:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,588 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2020-12-09 17:31:58,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2020-12-09 17:31:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 17:31:58,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,589 INFO L422 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] [2020-12-09 17:31:58,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 17:31:58,589 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1296114642, now seen corresponding path program 1 times [2020-12-09 17:31:58,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170019391] [2020-12-09 17:31:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170019391] [2020-12-09 17:31:58,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531271429] [2020-12-09 17:31:58,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,613 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand 3 states. [2020-12-09 17:31:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,699 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2020-12-09 17:31:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-09 17:31:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,700 INFO L225 Difference]: With dead ends: 320 [2020-12-09 17:31:58,700 INFO L226 Difference]: Without dead ends: 165 [2020-12-09 17:31:58,701 INFO L677 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 [2020-12-09 17:31:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-09 17:31:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-12-09 17:31:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 17:31:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2020-12-09 17:31:58,706 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 25 [2020-12-09 17:31:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,706 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2020-12-09 17:31:58,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2020-12-09 17:31:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 17:31:58,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,707 INFO L422 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] [2020-12-09 17:31:58,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 17:31:58,708 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 290163119, now seen corresponding path program 1 times [2020-12-09 17:31:58,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310364025] [2020-12-09 17:31:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310364025] [2020-12-09 17:31:58,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:58,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005238945] [2020-12-09 17:31:58,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:58,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:58,728 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand 3 states. [2020-12-09 17:31:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:58,808 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2020-12-09 17:31:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:58,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-09 17:31:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:58,809 INFO L225 Difference]: With dead ends: 320 [2020-12-09 17:31:58,809 INFO L226 Difference]: Without dead ends: 165 [2020-12-09 17:31:58,810 INFO L677 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 [2020-12-09 17:31:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-09 17:31:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-12-09 17:31:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-09 17:31:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2020-12-09 17:31:58,815 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 26 [2020-12-09 17:31:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:58,816 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2020-12-09 17:31:58,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2020-12-09 17:31:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 17:31:58,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:58,816 INFO L422 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] [2020-12-09 17:31:58,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 17:31:58,817 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -927156919, now seen corresponding path program 1 times [2020-12-09 17:31:58,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:58,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143922927] [2020-12-09 17:31:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:58,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143922927] [2020-12-09 17:31:58,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:58,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:31:58,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426892969] [2020-12-09 17:31:58,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:31:58,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:31:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:31:58,849 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand 4 states. [2020-12-09 17:31:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,041 INFO L93 Difference]: Finished difference Result 446 states and 659 transitions. [2020-12-09 17:31:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 17:31:59,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-09 17:31:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,043 INFO L225 Difference]: With dead ends: 446 [2020-12-09 17:31:59,043 INFO L226 Difference]: Without dead ends: 291 [2020-12-09 17:31:59,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:31:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-09 17:31:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2020-12-09 17:31:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-12-09 17:31:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 397 transitions. [2020-12-09 17:31:59,054 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 397 transitions. Word has length 26 [2020-12-09 17:31:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,055 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 397 transitions. [2020-12-09 17:31:59,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:31:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2020-12-09 17:31:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 17:31:59,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,056 INFO L422 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] [2020-12-09 17:31:59,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 17:31:59,056 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash -552784611, now seen corresponding path program 1 times [2020-12-09 17:31:59,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2228247] [2020-12-09 17:31:59,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:59,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2228247] [2020-12-09 17:31:59,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704605592] [2020-12-09 17:31:59,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,083 INFO L87 Difference]: Start difference. First operand 267 states and 397 transitions. Second operand 3 states. [2020-12-09 17:31:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,227 INFO L93 Difference]: Finished difference Result 612 states and 929 transitions. [2020-12-09 17:31:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:59,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-09 17:31:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,230 INFO L225 Difference]: With dead ends: 612 [2020-12-09 17:31:59,230 INFO L226 Difference]: Without dead ends: 347 [2020-12-09 17:31:59,230 INFO L677 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 [2020-12-09 17:31:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-12-09 17:31:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2020-12-09 17:31:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-12-09 17:31:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2020-12-09 17:31:59,245 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 39 [2020-12-09 17:31:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,246 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2020-12-09 17:31:59,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2020-12-09 17:31:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 17:31:59,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,247 INFO L422 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] [2020-12-09 17:31:59,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 17:31:59,248 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1888920597, now seen corresponding path program 1 times [2020-12-09 17:31:59,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174346871] [2020-12-09 17:31:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:59,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174346871] [2020-12-09 17:31:59,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860769426] [2020-12-09 17:31:59,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,280 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand 3 states. [2020-12-09 17:31:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,410 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2020-12-09 17:31:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:59,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-09 17:31:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,412 INFO L225 Difference]: With dead ends: 670 [2020-12-09 17:31:59,412 INFO L226 Difference]: Without dead ends: 341 [2020-12-09 17:31:59,413 INFO L677 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 [2020-12-09 17:31:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-12-09 17:31:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 332. [2020-12-09 17:31:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-12-09 17:31:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2020-12-09 17:31:59,425 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 40 [2020-12-09 17:31:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,425 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2020-12-09 17:31:59,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2020-12-09 17:31:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 17:31:59,427 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,427 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 17:31:59,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 17:31:59,427 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 968251981, now seen corresponding path program 1 times [2020-12-09 17:31:59,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422846486] [2020-12-09 17:31:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 17:31:59,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422846486] [2020-12-09 17:31:59,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147982656] [2020-12-09 17:31:59,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,457 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2020-12-09 17:31:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,572 INFO L93 Difference]: Finished difference Result 710 states and 1087 transitions. [2020-12-09 17:31:59,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:59,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-12-09 17:31:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,574 INFO L225 Difference]: With dead ends: 710 [2020-12-09 17:31:59,574 INFO L226 Difference]: Without dead ends: 380 [2020-12-09 17:31:59,575 INFO L677 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 [2020-12-09 17:31:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-12-09 17:31:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2020-12-09 17:31:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-12-09 17:31:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2020-12-09 17:31:59,593 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 49 [2020-12-09 17:31:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,594 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2020-12-09 17:31:59,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2020-12-09 17:31:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-09 17:31:59,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,595 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:59,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 17:31:59,595 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash -696687195, now seen corresponding path program 1 times [2020-12-09 17:31:59,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463430874] [2020-12-09 17:31:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 17:31:59,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463430874] [2020-12-09 17:31:59,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888300486] [2020-12-09 17:31:59,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,624 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 3 states. [2020-12-09 17:31:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,745 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2020-12-09 17:31:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:59,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-12-09 17:31:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,748 INFO L225 Difference]: With dead ends: 791 [2020-12-09 17:31:59,748 INFO L226 Difference]: Without dead ends: 429 [2020-12-09 17:31:59,749 INFO L677 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 [2020-12-09 17:31:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-12-09 17:31:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-12-09 17:31:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-09 17:31:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2020-12-09 17:31:59,762 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 49 [2020-12-09 17:31:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,762 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2020-12-09 17:31:59,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2020-12-09 17:31:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-09 17:31:59,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,763 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 17:31:59,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 17:31:59,763 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash 164519838, now seen corresponding path program 1 times [2020-12-09 17:31:59,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313872256] [2020-12-09 17:31:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 17:31:59,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313872256] [2020-12-09 17:31:59,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175076986] [2020-12-09 17:31:59,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,794 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand 3 states. [2020-12-09 17:31:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:31:59,911 INFO L93 Difference]: Finished difference Result 860 states and 1309 transitions. [2020-12-09 17:31:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:31:59,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-09 17:31:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:31:59,913 INFO L225 Difference]: With dead ends: 860 [2020-12-09 17:31:59,913 INFO L226 Difference]: Without dead ends: 435 [2020-12-09 17:31:59,914 INFO L677 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 [2020-12-09 17:31:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-12-09 17:31:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2020-12-09 17:31:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-09 17:31:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 645 transitions. [2020-12-09 17:31:59,928 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 645 transitions. Word has length 61 [2020-12-09 17:31:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:31:59,928 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 645 transitions. [2020-12-09 17:31:59,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:31:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 645 transitions. [2020-12-09 17:31:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-09 17:31:59,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:31:59,929 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:31:59,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 17:31:59,929 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:31:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:31:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 28655439, now seen corresponding path program 1 times [2020-12-09 17:31:59,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:31:59,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590431904] [2020-12-09 17:31:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:31:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:31:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:31:59,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590431904] [2020-12-09 17:31:59,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:31:59,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:31:59,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107388591] [2020-12-09 17:31:59,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:31:59,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:31:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:31:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:31:59,964 INFO L87 Difference]: Start difference. First operand 427 states and 645 transitions. Second operand 3 states. [2020-12-09 17:32:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,113 INFO L93 Difference]: Finished difference Result 897 states and 1354 transitions. [2020-12-09 17:32:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-09 17:32:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,116 INFO L225 Difference]: With dead ends: 897 [2020-12-09 17:32:00,116 INFO L226 Difference]: Without dead ends: 472 [2020-12-09 17:32:00,117 INFO L677 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 [2020-12-09 17:32:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-12-09 17:32:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2020-12-09 17:32:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-12-09 17:32:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2020-12-09 17:32:00,132 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 72 [2020-12-09 17:32:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,132 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2020-12-09 17:32:00,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2020-12-09 17:32:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-09 17:32:00,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,134 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:00,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 17:32:00,134 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2086512311, now seen corresponding path program 1 times [2020-12-09 17:32:00,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844400512] [2020-12-09 17:32:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:32:00,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844400512] [2020-12-09 17:32:00,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166362386] [2020-12-09 17:32:00,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,164 INFO L87 Difference]: Start difference. First operand 468 states and 704 transitions. Second operand 3 states. [2020-12-09 17:32:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,283 INFO L93 Difference]: Finished difference Result 936 states and 1408 transitions. [2020-12-09 17:32:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-09 17:32:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,286 INFO L225 Difference]: With dead ends: 936 [2020-12-09 17:32:00,286 INFO L226 Difference]: Without dead ends: 470 [2020-12-09 17:32:00,287 INFO L677 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 [2020-12-09 17:32:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-12-09 17:32:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2020-12-09 17:32:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-12-09 17:32:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2020-12-09 17:32:00,301 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 73 [2020-12-09 17:32:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,301 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2020-12-09 17:32:00,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2020-12-09 17:32:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-09 17:32:00,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,302 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:00,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 17:32:00,303 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash -247676427, now seen corresponding path program 1 times [2020-12-09 17:32:00,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949459163] [2020-12-09 17:32:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 17:32:00,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949459163] [2020-12-09 17:32:00,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222390400] [2020-12-09 17:32:00,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,329 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand 3 states. [2020-12-09 17:32:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,445 INFO L93 Difference]: Finished difference Result 934 states and 1400 transitions. [2020-12-09 17:32:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-09 17:32:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,447 INFO L225 Difference]: With dead ends: 934 [2020-12-09 17:32:00,447 INFO L226 Difference]: Without dead ends: 468 [2020-12-09 17:32:00,448 INFO L677 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 [2020-12-09 17:32:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-12-09 17:32:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2020-12-09 17:32:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-12-09 17:32:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2020-12-09 17:32:00,464 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 78 [2020-12-09 17:32:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,464 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2020-12-09 17:32:00,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2020-12-09 17:32:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 17:32:00,465 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,465 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 17:32:00,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 17:32:00,465 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash -41979843, now seen corresponding path program 1 times [2020-12-09 17:32:00,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49792657] [2020-12-09 17:32:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-09 17:32:00,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49792657] [2020-12-09 17:32:00,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986908350] [2020-12-09 17:32:00,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,488 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand 3 states. [2020-12-09 17:32:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,598 INFO L93 Difference]: Finished difference Result 980 states and 1462 transitions. [2020-12-09 17:32:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-09 17:32:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,601 INFO L225 Difference]: With dead ends: 980 [2020-12-09 17:32:00,601 INFO L226 Difference]: Without dead ends: 516 [2020-12-09 17:32:00,602 INFO L677 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 [2020-12-09 17:32:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-12-09 17:32:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2020-12-09 17:32:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-12-09 17:32:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 732 transitions. [2020-12-09 17:32:00,617 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 732 transitions. Word has length 85 [2020-12-09 17:32:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,617 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 732 transitions. [2020-12-09 17:32:00,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 732 transitions. [2020-12-09 17:32:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-09 17:32:00,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,618 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 17:32:00,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 17:32:00,618 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1023860646, now seen corresponding path program 1 times [2020-12-09 17:32:00,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665740631] [2020-12-09 17:32:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-09 17:32:00,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665740631] [2020-12-09 17:32:00,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639559083] [2020-12-09 17:32:00,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,641 INFO L87 Difference]: Start difference. First operand 496 states and 732 transitions. Second operand 3 states. [2020-12-09 17:32:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,746 INFO L93 Difference]: Finished difference Result 1000 states and 1478 transitions. [2020-12-09 17:32:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-09 17:32:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,749 INFO L225 Difference]: With dead ends: 1000 [2020-12-09 17:32:00,749 INFO L226 Difference]: Without dead ends: 506 [2020-12-09 17:32:00,749 INFO L677 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 [2020-12-09 17:32:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-12-09 17:32:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2020-12-09 17:32:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-12-09 17:32:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2020-12-09 17:32:00,772 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 86 [2020-12-09 17:32:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,772 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2020-12-09 17:32:00,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2020-12-09 17:32:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-09 17:32:00,773 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,773 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:00,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 17:32:00,774 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2140375978, now seen corresponding path program 1 times [2020-12-09 17:32:00,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329383218] [2020-12-09 17:32:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 17:32:00,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329383218] [2020-12-09 17:32:00,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125111279] [2020-12-09 17:32:00,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,806 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand 3 states. [2020-12-09 17:32:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:00,947 INFO L93 Difference]: Finished difference Result 1044 states and 1527 transitions. [2020-12-09 17:32:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:00,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-09 17:32:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:00,949 INFO L225 Difference]: With dead ends: 1044 [2020-12-09 17:32:00,950 INFO L226 Difference]: Without dead ends: 550 [2020-12-09 17:32:00,950 INFO L677 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 [2020-12-09 17:32:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-09 17:32:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2020-12-09 17:32:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-12-09 17:32:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 797 transitions. [2020-12-09 17:32:00,965 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 797 transitions. Word has length 90 [2020-12-09 17:32:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:00,966 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 797 transitions. [2020-12-09 17:32:00,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 797 transitions. [2020-12-09 17:32:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-09 17:32:00,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:00,967 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:00,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 17:32:00,967 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2122036126, now seen corresponding path program 1 times [2020-12-09 17:32:00,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:00,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238603751] [2020-12-09 17:32:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 17:32:00,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238603751] [2020-12-09 17:32:00,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:00,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:00,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700605079] [2020-12-09 17:32:00,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:00,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:00,991 INFO L87 Difference]: Start difference. First operand 546 states and 797 transitions. Second operand 3 states. [2020-12-09 17:32:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:01,124 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2020-12-09 17:32:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:01,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-12-09 17:32:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:01,127 INFO L225 Difference]: With dead ends: 1093 [2020-12-09 17:32:01,127 INFO L226 Difference]: Without dead ends: 545 [2020-12-09 17:32:01,127 INFO L677 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 [2020-12-09 17:32:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-12-09 17:32:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2020-12-09 17:32:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-12-09 17:32:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 791 transitions. [2020-12-09 17:32:01,143 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 791 transitions. Word has length 91 [2020-12-09 17:32:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:01,143 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 791 transitions. [2020-12-09 17:32:01,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 791 transitions. [2020-12-09 17:32:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-09 17:32:01,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:01,144 INFO L422 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:01,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 17:32:01,144 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash -387568645, now seen corresponding path program 1 times [2020-12-09 17:32:01,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:01,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719417651] [2020-12-09 17:32:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-09 17:32:01,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719417651] [2020-12-09 17:32:01,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:01,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:01,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696525154] [2020-12-09 17:32:01,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:01,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:01,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:01,185 INFO L87 Difference]: Start difference. First operand 543 states and 791 transitions. Second operand 3 states. [2020-12-09 17:32:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:01,309 INFO L93 Difference]: Finished difference Result 1127 states and 1639 transitions. [2020-12-09 17:32:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:01,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-09 17:32:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:01,311 INFO L225 Difference]: With dead ends: 1127 [2020-12-09 17:32:01,312 INFO L226 Difference]: Without dead ends: 586 [2020-12-09 17:32:01,312 INFO L677 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 [2020-12-09 17:32:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-12-09 17:32:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2020-12-09 17:32:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-12-09 17:32:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 841 transitions. [2020-12-09 17:32:01,329 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 841 transitions. Word has length 103 [2020-12-09 17:32:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:01,329 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 841 transitions. [2020-12-09 17:32:01,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 841 transitions. [2020-12-09 17:32:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-09 17:32:01,330 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:01,330 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:01,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-09 17:32:01,330 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1341072435, now seen corresponding path program 1 times [2020-12-09 17:32:01,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:01,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860637756] [2020-12-09 17:32:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-09 17:32:01,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860637756] [2020-12-09 17:32:01,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:01,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:01,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659061846] [2020-12-09 17:32:01,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:01,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:01,355 INFO L87 Difference]: Start difference. First operand 582 states and 841 transitions. Second operand 3 states. [2020-12-09 17:32:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:01,500 INFO L93 Difference]: Finished difference Result 1164 states and 1682 transitions. [2020-12-09 17:32:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:01,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-09 17:32:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:01,503 INFO L225 Difference]: With dead ends: 1164 [2020-12-09 17:32:01,503 INFO L226 Difference]: Without dead ends: 584 [2020-12-09 17:32:01,504 INFO L677 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 [2020-12-09 17:32:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-12-09 17:32:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2020-12-09 17:32:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-12-09 17:32:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2020-12-09 17:32:01,520 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 104 [2020-12-09 17:32:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:01,520 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2020-12-09 17:32:01,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2020-12-09 17:32:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-09 17:32:01,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:01,522 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-12-09 17:32:01,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-09 17:32:01,522 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1479794679, now seen corresponding path program 1 times [2020-12-09 17:32:01,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:01,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030678512] [2020-12-09 17:32:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 17:32:01,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030678512] [2020-12-09 17:32:01,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:01,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:01,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567727650] [2020-12-09 17:32:01,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:01,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:01,552 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand 3 states. [2020-12-09 17:32:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:01,688 INFO L93 Difference]: Finished difference Result 1198 states and 1720 transitions. [2020-12-09 17:32:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:01,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-09 17:32:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:01,690 INFO L225 Difference]: With dead ends: 1198 [2020-12-09 17:32:01,690 INFO L226 Difference]: Without dead ends: 618 [2020-12-09 17:32:01,691 INFO L677 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 [2020-12-09 17:32:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-12-09 17:32:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2020-12-09 17:32:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-12-09 17:32:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 867 transitions. [2020-12-09 17:32:01,709 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 867 transitions. Word has length 106 [2020-12-09 17:32:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:01,709 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 867 transitions. [2020-12-09 17:32:01,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 867 transitions. [2020-12-09 17:32:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-09 17:32:01,710 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:01,710 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-12-09 17:32:01,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-09 17:32:01,710 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1663039334, now seen corresponding path program 1 times [2020-12-09 17:32:01,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:01,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709583464] [2020-12-09 17:32:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 17:32:01,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709583464] [2020-12-09 17:32:01,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:01,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:01,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192101016] [2020-12-09 17:32:01,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:01,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:01,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:01,733 INFO L87 Difference]: Start difference. First operand 610 states and 867 transitions. Second operand 3 states. [2020-12-09 17:32:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:01,842 INFO L93 Difference]: Finished difference Result 1222 states and 1737 transitions. [2020-12-09 17:32:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-12-09 17:32:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:01,845 INFO L225 Difference]: With dead ends: 1222 [2020-12-09 17:32:01,845 INFO L226 Difference]: Without dead ends: 614 [2020-12-09 17:32:01,846 INFO L677 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 [2020-12-09 17:32:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-12-09 17:32:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2020-12-09 17:32:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-12-09 17:32:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 858 transitions. [2020-12-09 17:32:01,863 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 858 transitions. Word has length 107 [2020-12-09 17:32:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:01,864 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 858 transitions. [2020-12-09 17:32:01,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 858 transitions. [2020-12-09 17:32:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-09 17:32:01,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:01,865 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-12-09 17:32:01,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-09 17:32:01,865 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1022655758, now seen corresponding path program 1 times [2020-12-09 17:32:01,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:01,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727012396] [2020-12-09 17:32:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-12-09 17:32:01,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727012396] [2020-12-09 17:32:01,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:01,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:01,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124498667] [2020-12-09 17:32:01,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:01,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:01,890 INFO L87 Difference]: Start difference. First operand 610 states and 858 transitions. Second operand 3 states. [2020-12-09 17:32:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:02,001 INFO L93 Difference]: Finished difference Result 1248 states and 1754 transitions. [2020-12-09 17:32:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:02,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-09 17:32:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:02,004 INFO L225 Difference]: With dead ends: 1248 [2020-12-09 17:32:02,004 INFO L226 Difference]: Without dead ends: 640 [2020-12-09 17:32:02,005 INFO L677 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 [2020-12-09 17:32:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-12-09 17:32:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2020-12-09 17:32:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-12-09 17:32:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 884 transitions. [2020-12-09 17:32:02,024 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 884 transitions. Word has length 124 [2020-12-09 17:32:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:02,024 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 884 transitions. [2020-12-09 17:32:02,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 884 transitions. [2020-12-09 17:32:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-09 17:32:02,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:02,025 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-12-09 17:32:02,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-09 17:32:02,026 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2111043695, now seen corresponding path program 1 times [2020-12-09 17:32:02,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:02,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088841571] [2020-12-09 17:32:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-12-09 17:32:02,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088841571] [2020-12-09 17:32:02,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:02,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:02,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633444255] [2020-12-09 17:32:02,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:02,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:02,051 INFO L87 Difference]: Start difference. First operand 636 states and 884 transitions. Second operand 3 states. [2020-12-09 17:32:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:02,162 INFO L93 Difference]: Finished difference Result 1272 states and 1768 transitions. [2020-12-09 17:32:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:02,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-09 17:32:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:02,165 INFO L225 Difference]: With dead ends: 1272 [2020-12-09 17:32:02,165 INFO L226 Difference]: Without dead ends: 638 [2020-12-09 17:32:02,166 INFO L677 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 [2020-12-09 17:32:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-12-09 17:32:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2020-12-09 17:32:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-12-09 17:32:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 874 transitions. [2020-12-09 17:32:02,185 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 874 transitions. Word has length 125 [2020-12-09 17:32:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:02,185 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 874 transitions. [2020-12-09 17:32:02,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 874 transitions. [2020-12-09 17:32:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 17:32:02,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:02,186 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:02,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 17:32:02,187 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1574687855, now seen corresponding path program 1 times [2020-12-09 17:32:02,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:02,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777040867] [2020-12-09 17:32:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-09 17:32:02,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777040867] [2020-12-09 17:32:02,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:02,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:02,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744060258] [2020-12-09 17:32:02,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:02,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:02,216 INFO L87 Difference]: Start difference. First operand 636 states and 874 transitions. Second operand 3 states. [2020-12-09 17:32:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:02,391 INFO L93 Difference]: Finished difference Result 1321 states and 1809 transitions. [2020-12-09 17:32:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:02,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-12-09 17:32:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:02,394 INFO L225 Difference]: With dead ends: 1321 [2020-12-09 17:32:02,394 INFO L226 Difference]: Without dead ends: 687 [2020-12-09 17:32:02,395 INFO L677 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 [2020-12-09 17:32:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-12-09 17:32:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2020-12-09 17:32:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-12-09 17:32:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 928 transitions. [2020-12-09 17:32:02,422 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 928 transitions. Word has length 129 [2020-12-09 17:32:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:02,422 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 928 transitions. [2020-12-09 17:32:02,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 928 transitions. [2020-12-09 17:32:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-09 17:32:02,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:02,424 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:02,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 17:32:02,424 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 130516969, now seen corresponding path program 1 times [2020-12-09 17:32:02,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:02,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66894966] [2020-12-09 17:32:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-09 17:32:02,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66894966] [2020-12-09 17:32:02,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:02,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:02,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779847295] [2020-12-09 17:32:02,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:02,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:02,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:02,454 INFO L87 Difference]: Start difference. First operand 681 states and 928 transitions. Second operand 3 states. [2020-12-09 17:32:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:02,607 INFO L93 Difference]: Finished difference Result 1363 states and 1857 transitions. [2020-12-09 17:32:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:02,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2020-12-09 17:32:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:02,611 INFO L225 Difference]: With dead ends: 1363 [2020-12-09 17:32:02,611 INFO L226 Difference]: Without dead ends: 668 [2020-12-09 17:32:02,612 INFO L677 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 [2020-12-09 17:32:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-12-09 17:32:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 665. [2020-12-09 17:32:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-12-09 17:32:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 905 transitions. [2020-12-09 17:32:02,644 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 905 transitions. Word has length 130 [2020-12-09 17:32:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:02,644 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 905 transitions. [2020-12-09 17:32:02,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 905 transitions. [2020-12-09 17:32:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-09 17:32:02,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:02,646 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-12-09 17:32:02,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 17:32:02,646 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -352886759, now seen corresponding path program 1 times [2020-12-09 17:32:02,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:02,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994996037] [2020-12-09 17:32:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-09 17:32:02,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994996037] [2020-12-09 17:32:02,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:02,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:02,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217526202] [2020-12-09 17:32:02,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:02,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:02,680 INFO L87 Difference]: Start difference. First operand 665 states and 905 transitions. Second operand 3 states. [2020-12-09 17:32:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:02,823 INFO L93 Difference]: Finished difference Result 1332 states and 1813 transitions. [2020-12-09 17:32:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:02,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-09 17:32:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:02,826 INFO L225 Difference]: With dead ends: 1332 [2020-12-09 17:32:02,827 INFO L226 Difference]: Without dead ends: 669 [2020-12-09 17:32:02,828 INFO L677 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 [2020-12-09 17:32:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-12-09 17:32:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2020-12-09 17:32:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-12-09 17:32:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 898 transitions. [2020-12-09 17:32:02,857 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 898 transitions. Word has length 134 [2020-12-09 17:32:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:02,857 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 898 transitions. [2020-12-09 17:32:02,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 898 transitions. [2020-12-09 17:32:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-09 17:32:02,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:02,858 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:02,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 17:32:02,858 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 277686337, now seen corresponding path program 1 times [2020-12-09 17:32:02,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:02,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006345466] [2020-12-09 17:32:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-09 17:32:02,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006345466] [2020-12-09 17:32:02,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:02,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 17:32:02,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457266461] [2020-12-09 17:32:02,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:02,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:02,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:02,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:02,886 INFO L87 Difference]: Start difference. First operand 665 states and 898 transitions. Second operand 3 states. [2020-12-09 17:32:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:03,003 INFO L93 Difference]: Finished difference Result 1320 states and 1782 transitions. [2020-12-09 17:32:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:03,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2020-12-09 17:32:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:03,006 INFO L225 Difference]: With dead ends: 1320 [2020-12-09 17:32:03,006 INFO L226 Difference]: Without dead ends: 640 [2020-12-09 17:32:03,006 INFO L677 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 [2020-12-09 17:32:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-12-09 17:32:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2020-12-09 17:32:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-12-09 17:32:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 853 transitions. [2020-12-09 17:32:03,026 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 853 transitions. Word has length 135 [2020-12-09 17:32:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:03,026 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 853 transitions. [2020-12-09 17:32:03,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 853 transitions. [2020-12-09 17:32:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-09 17:32:03,027 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:03,027 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:03,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-09 17:32:03,027 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash -851819289, now seen corresponding path program 1 times [2020-12-09 17:32:03,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:03,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986255834] [2020-12-09 17:32:03,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:32:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-12-09 17:32:03,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986255834] [2020-12-09 17:32:03,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:32:03,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:32:03,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123438828] [2020-12-09 17:32:03,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:32:03,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:32:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:32:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:32:03,068 INFO L87 Difference]: Start difference. First operand 636 states and 853 transitions. Second operand 3 states. [2020-12-09 17:32:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:32:03,123 INFO L93 Difference]: Finished difference Result 1885 states and 2523 transitions. [2020-12-09 17:32:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:32:03,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2020-12-09 17:32:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:32:03,128 INFO L225 Difference]: With dead ends: 1885 [2020-12-09 17:32:03,128 INFO L226 Difference]: Without dead ends: 1251 [2020-12-09 17:32:03,129 INFO L677 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 [2020-12-09 17:32:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-12-09 17:32:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2020-12-09 17:32:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2020-12-09 17:32:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1668 transitions. [2020-12-09 17:32:03,171 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1668 transitions. Word has length 139 [2020-12-09 17:32:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:32:03,171 INFO L481 AbstractCegarLoop]: Abstraction has 1249 states and 1668 transitions. [2020-12-09 17:32:03,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:32:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1668 transitions. [2020-12-09 17:32:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-09 17:32:03,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:32:03,172 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:32:03,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 17:32:03,173 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:32:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:32:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1720290077, now seen corresponding path program 1 times [2020-12-09 17:32:03,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:32:03,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132466387] [2020-12-09 17:32:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:32:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:32:03,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:32:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:32:03,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:32:03,272 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 17:32:03,272 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 17:32:03,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-09 17:32:03,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:32:03 BoogieIcfgContainer [2020-12-09 17:32:03,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:32:03,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:32:03,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:32:03,350 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:32:03,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57" (3/4) ... [2020-12-09 17:32:03,352 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 17:32:03,434 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_91966d4b-835f-4d0f-bb44-37feb520695d/bin/utaipan/witness.graphml [2020-12-09 17:32:03,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:32:03,436 INFO L168 Benchmark]: Toolchain (without parser) took 7190.95 ms. Allocated memory was 111.1 MB in the beginning and 318.8 MB in the end (delta: 207.6 MB). Free memory was 81.8 MB in the beginning and 187.9 MB in the end (delta: -106.1 MB). Peak memory consumption was 102.9 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,436 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 111.1 MB. Free memory is still 88.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:32:03,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.54 ms. Allocated memory is still 111.1 MB. Free memory was 81.6 MB in the beginning and 65.8 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 111.1 MB. Free memory was 65.8 MB in the beginning and 62.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,437 INFO L168 Benchmark]: Boogie Preprocessor took 55.08 ms. Allocated memory is still 111.1 MB. Free memory was 62.8 MB in the beginning and 88.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,438 INFO L168 Benchmark]: RCFGBuilder took 834.37 ms. Allocated memory was 111.1 MB in the beginning and 182.5 MB in the end (delta: 71.3 MB). Free memory was 88.5 MB in the beginning and 123.0 MB in the end (delta: -34.5 MB). Peak memory consumption was 43.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,438 INFO L168 Benchmark]: TraceAbstraction took 5908.43 ms. Allocated memory was 182.5 MB in the beginning and 318.8 MB in the end (delta: 136.3 MB). Free memory was 121.8 MB in the beginning and 204.7 MB in the end (delta: -82.9 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,438 INFO L168 Benchmark]: Witness Printer took 83.97 ms. Allocated memory is still 318.8 MB. Free memory was 204.7 MB in the beginning and 187.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:32:03,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 111.1 MB. Free memory is still 88.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 260.54 ms. Allocated memory is still 111.1 MB. Free memory was 81.6 MB in the beginning and 65.8 MB in the end (delta: 15.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.06 ms. Allocated memory is still 111.1 MB. Free memory was 65.8 MB in the beginning and 62.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.08 ms. Allocated memory is still 111.1 MB. Free memory was 62.8 MB in the beginning and 88.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 834.37 ms. Allocated memory was 111.1 MB in the beginning and 182.5 MB in the end (delta: 71.3 MB). Free memory was 88.5 MB in the beginning and 123.0 MB in the end (delta: -34.5 MB). Peak memory consumption was 43.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5908.43 ms. Allocated memory was 182.5 MB in the beginning and 318.8 MB in the end (delta: 136.3 MB). Free memory was 121.8 MB in the beginning and 204.7 MB in the end (delta: -82.9 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. * Witness Printer took 83.97 ms. Allocated memory is still 318.8 MB. Free memory was 204.7 MB in the beginning and 187.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 699]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] int s ; [L705] int tmp ; [L709] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] Time = tmp [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] got_new_session = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND TRUE tmp___1 + 12288 [L93] COND TRUE tmp___2 + 16384 [L97] COND FALSE !(s__cert == 0) [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND TRUE s__state == 8464 [L274] s__shutdown = 0 [L275] ret = __VERIFIER_nondet_int() [L276] COND TRUE blastFlag == 0 [L277] blastFlag = 1 [L279] COND FALSE !(ret <= 0) [L282] got_new_session = 1 [L283] s__state = 8496 [L284] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND TRUE s__state == 8496 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L295] COND FALSE !(\read(s__hit)) [L298] s__state = 8512 [L300] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND TRUE s__state == 8512 [L305] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L306] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L307] COND TRUE __cil_tmp56 + 256UL [L308] __cil_tmp56 = 256345 [L309] skip = 1 [L320] s__state = 8528 [L321] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND TRUE s__state == 8528 [L325] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L326] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L328] __cil_tmp57 = (unsigned long )s__options [L329] COND TRUE __cil_tmp57 + 2097152UL [L330] s__s3__tmp__use_rsa_tmp = 1 [L335] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L363] ret = __VERIFIER_nondet_int() [L364] COND FALSE !(blastFlag == 3) [L367] COND FALSE !(ret <= 0) [L384] s__state = 8544 [L385] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND TRUE s__state == 8544 [L389] COND TRUE s__verify_mode + 1 [L390] COND TRUE s__session__peer != 0 [L391] COND TRUE s__verify_mode + 4 [L392] s__verify_mode = 123 [L393] skip = 1 [L394] s__s3__tmp__cert_request = 0 [L395] s__state = 8560 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND FALSE !(s__state == 8544) [L158] COND FALSE !(s__state == 8545) [L161] COND TRUE s__state == 8560 [L439] ret = __VERIFIER_nondet_int() [L440] COND FALSE !(ret <= 0) [L443] s__s3__tmp__next_state___0 = 8576 [L444] s__state = 8448 [L445] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND TRUE ! s__s3__tmp__reuse_message [L655] COND TRUE ! skip [L656] COND TRUE state == 8560 [L657] COND TRUE s__state == 8448 [L658] COND TRUE s__verify_mode != -1 [L659] COND TRUE s__verify_mode != -2 [L660] COND TRUE __cil_tmp61 != 9021 [L661] COND TRUE __cil_tmp58 != 4294967294 [L662] COND TRUE blastFlag != 4 [L663] COND TRUE tmp___7 != 1024 [L699] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.7s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3969 SDtfs, 4395 SDslu, 816 SDs, 0 SdLazy, 2772 SolverSat, 1263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 198 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2332 ConstructedInterpolants, 0 QuantifiedInterpolants, 394525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 1895/1895 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...