./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7 --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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:09:22,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:09:22,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:09:22,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:09:22,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:09:22,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:09:22,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:09:22,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:09:22,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:09:22,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:09:22,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:09:22,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:09:22,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:09:22,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:09:22,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:09:22,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:09:22,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:09:22,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:09:22,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:09:22,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:09:22,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:09:22,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:09:22,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:09:22,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:09:22,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:09:22,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:09:22,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:09:22,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:09:22,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:09:22,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:09:22,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:09:22,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:09:22,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:09:22,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:09:22,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:09:22,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:09:22,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:09:22,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:09:22,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:09:22,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:09:22,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:09:22,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:09:22,565 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:09:22,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:09:22,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:09:22,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:09:22,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:09:22,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:09:22,566 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:09:22,567 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:09:22,567 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:09:22,567 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:09:22,567 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:09:22,567 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:09:22,567 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:09:22,568 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:09:22,568 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:09:22,568 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:09:22,568 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:09:22,568 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:09:22,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:09:22,569 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:09:22,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:09:22,571 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:09:22,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:09:22,571 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:09:22,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:09:22,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:09:22,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:09:22,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:09:22,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:09:22,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:09:22,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:09:22,573 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:09:22,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:09:22,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:09:22,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:09:22,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:09:22,574 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_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/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_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-11-25 20:09:22,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:09:22,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:09:22,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:09:22,865 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:09:22,866 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:09:22,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-25 20:09:22,949 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/data/f24626a81/0e26951a490d4667bd2b6b7d2cad3794/FLAG68456fbbd [2021-11-25 20:09:23,540 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:09:23,541 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-25 20:09:23,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/data/f24626a81/0e26951a490d4667bd2b6b7d2cad3794/FLAG68456fbbd [2021-11-25 20:09:23,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/data/f24626a81/0e26951a490d4667bd2b6b7d2cad3794 [2021-11-25 20:09:23,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:09:23,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:09:23,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:09:23,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:09:23,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:09:23,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:09:23" (1/1) ... [2021-11-25 20:09:23,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1653cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:23, skipping insertion in model container [2021-11-25 20:09:23,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:09:23" (1/1) ... [2021-11-25 20:09:23,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:09:23,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:09:24,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-25 20:09:24,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:09:24,214 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:09:24,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-25 20:09:24,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:09:24,353 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:09:24,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24 WrapperNode [2021-11-25 20:09:24,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:09:24,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:09:24,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:09:24,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:09:24,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,467 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2021-11-25 20:09:24,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:09:24,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:09:24,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:09:24,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:09:24,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:09:24,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:09:24,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:09:24,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:09:24,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (1/1) ... [2021-11-25 20:09:24,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:09:24,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:24,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:09:24,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:09:24,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:09:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-11-25 20:09:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-11-25 20:09:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-11-25 20:09:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-11-25 20:09:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-11-25 20:09:24,614 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-11-25 20:09:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-11-25 20:09:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-11-25 20:09:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-11-25 20:09:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-11-25 20:09:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-11-25 20:09:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-11-25 20:09:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:09:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-11-25 20:09:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-11-25 20:09:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-11-25 20:09:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-11-25 20:09:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-11-25 20:09:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-11-25 20:09:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:09:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:09:24,786 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:09:24,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:09:24,793 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:24,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-25 20:09:24,870 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-25 20:09:24,872 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:24,898 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-11-25 20:09:24,898 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-11-25 20:09:24,949 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:24,958 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:24,977 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:25,525 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2021-11-25 20:09:25,525 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2021-11-25 20:09:25,525 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-25 20:09:25,526 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-25 20:09:25,526 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-11-25 20:09:25,526 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-11-25 20:09:25,527 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 20:09:25,568 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-11-25 20:09:25,568 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-11-25 20:09:25,633 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:09:25,780 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:09:25,780 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 20:09:25,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:09:25 BoogieIcfgContainer [2021-11-25 20:09:25,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:09:25,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:09:25,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:09:25,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:09:25,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:09:23" (1/3) ... [2021-11-25 20:09:25,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275ea5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:09:25, skipping insertion in model container [2021-11-25 20:09:25,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:24" (2/3) ... [2021-11-25 20:09:25,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275ea5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:09:25, skipping insertion in model container [2021-11-25 20:09:25,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:09:25" (3/3) ... [2021-11-25 20:09:25,794 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-11-25 20:09:25,805 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:09:25,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 20:09:25,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:09:25,877 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:09:25,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 20:09:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2021-11-25 20:09:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-25 20:09:25,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:25,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:25,908 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1518887749, now seen corresponding path program 1 times [2021-11-25 20:09:25,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103010209] [2021-11-25 20:09:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:25,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:26,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:26,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103010209] [2021-11-25 20:09:26,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103010209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:26,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:26,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:26,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941229414] [2021-11-25 20:09:26,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:26,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:26,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:26,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:26,296 INFO L87 Difference]: Start difference. First operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:26,673 INFO L93 Difference]: Finished difference Result 419 states and 667 transitions. [2021-11-25 20:09:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-25 20:09:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:26,689 INFO L225 Difference]: With dead ends: 419 [2021-11-25 20:09:26,689 INFO L226 Difference]: Without dead ends: 251 [2021-11-25 20:09:26,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:26,699 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 425 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:26,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 373 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-25 20:09:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2021-11-25 20:09:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 191 states have internal predecessors, (254), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2021-11-25 20:09:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 358 transitions. [2021-11-25 20:09:26,783 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 358 transitions. Word has length 9 [2021-11-25 20:09:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:26,783 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 358 transitions. [2021-11-25 20:09:26,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 358 transitions. [2021-11-25 20:09:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 20:09:26,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:26,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:26,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:09:26,787 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2001954206, now seen corresponding path program 1 times [2021-11-25 20:09:26,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:26,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140754881] [2021-11-25 20:09:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:26,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:26,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140754881] [2021-11-25 20:09:26,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140754881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:26,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:26,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:09:26,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298137465] [2021-11-25 20:09:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:26,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:26,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:26,847 INFO L87 Difference]: Start difference. First operand 248 states and 358 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:26,953 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2021-11-25 20:09:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-25 20:09:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:26,960 INFO L225 Difference]: With dead ends: 268 [2021-11-25 20:09:26,960 INFO L226 Difference]: Without dead ends: 248 [2021-11-25 20:09:26,965 INFO L932 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 [2021-11-25 20:09:26,967 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:26,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-25 20:09:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-11-25 20:09:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 191 states have internal predecessors, (253), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2021-11-25 20:09:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 357 transitions. [2021-11-25 20:09:27,026 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 357 transitions. Word has length 11 [2021-11-25 20:09:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:27,027 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 357 transitions. [2021-11-25 20:09:27,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 357 transitions. [2021-11-25 20:09:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 20:09:27,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:27,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:27,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:09:27,033 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2009523838, now seen corresponding path program 1 times [2021-11-25 20:09:27,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:27,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853091351] [2021-11-25 20:09:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:27,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:27,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853091351] [2021-11-25 20:09:27,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853091351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:27,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:27,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:27,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132898799] [2021-11-25 20:09:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:27,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:27,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:27,110 INFO L87 Difference]: Start difference. First operand 248 states and 357 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:27,219 INFO L93 Difference]: Finished difference Result 574 states and 843 transitions. [2021-11-25 20:09:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 20:09:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:27,228 INFO L225 Difference]: With dead ends: 574 [2021-11-25 20:09:27,228 INFO L226 Difference]: Without dead ends: 388 [2021-11-25 20:09:27,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:27,238 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 203 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:27,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 414 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-25 20:09:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 360. [2021-11-25 20:09:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 263 states have (on average 1.391634980988593) internal successors, (366), 271 states have internal predecessors, (366), 75 states have call successors, (75), 22 states have call predecessors, (75), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2021-11-25 20:09:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 531 transitions. [2021-11-25 20:09:27,302 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 531 transitions. Word has length 13 [2021-11-25 20:09:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:27,302 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 531 transitions. [2021-11-25 20:09:27,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 531 transitions. [2021-11-25 20:09:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 20:09:27,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:27,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:27,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:09:27,310 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1641123002, now seen corresponding path program 1 times [2021-11-25 20:09:27,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529216736] [2021-11-25 20:09:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:27,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:27,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529216736] [2021-11-25 20:09:27,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529216736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:27,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:27,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:27,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852066031] [2021-11-25 20:09:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:27,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:27,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:27,410 INFO L87 Difference]: Start difference. First operand 360 states and 531 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:27,523 INFO L93 Difference]: Finished difference Result 369 states and 542 transitions. [2021-11-25 20:09:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-25 20:09:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:27,527 INFO L225 Difference]: With dead ends: 369 [2021-11-25 20:09:27,527 INFO L226 Difference]: Without dead ends: 365 [2021-11-25 20:09:27,528 INFO L932 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 [2021-11-25 20:09:27,529 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:27,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 375 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-25 20:09:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-11-25 20:09:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3866171003717471) internal successors, (373), 275 states have internal predecessors, (373), 74 states have call successors, (74), 23 states have call predecessors, (74), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2021-11-25 20:09:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 537 transitions. [2021-11-25 20:09:27,558 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 537 transitions. Word has length 16 [2021-11-25 20:09:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:27,558 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 537 transitions. [2021-11-25 20:09:27,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 537 transitions. [2021-11-25 20:09:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:09:27,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:27,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:27,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:09:27,560 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1270154044, now seen corresponding path program 1 times [2021-11-25 20:09:27,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:27,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577923666] [2021-11-25 20:09:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:27,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:27,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577923666] [2021-11-25 20:09:27,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577923666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:27,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:27,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:27,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932475154] [2021-11-25 20:09:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:27,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:27,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:27,627 INFO L87 Difference]: Start difference. First operand 365 states and 537 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:27,947 INFO L93 Difference]: Finished difference Result 394 states and 573 transitions. [2021-11-25 20:09:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:27,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-25 20:09:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:27,954 INFO L225 Difference]: With dead ends: 394 [2021-11-25 20:09:27,955 INFO L226 Difference]: Without dead ends: 383 [2021-11-25 20:09:27,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:27,956 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 297 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:27,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 412 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-25 20:09:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2021-11-25 20:09:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 283 states have (on average 1.3816254416961131) internal successors, (391), 289 states have internal predecessors, (391), 74 states have call successors, (74), 23 states have call predecessors, (74), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2021-11-25 20:09:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 555 transitions. [2021-11-25 20:09:27,994 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 555 transitions. Word has length 20 [2021-11-25 20:09:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 555 transitions. [2021-11-25 20:09:27,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 555 transitions. [2021-11-25 20:09:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:09:27,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:27,998 INFO L514 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] [2021-11-25 20:09:27,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:09:27,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -126895172, now seen corresponding path program 1 times [2021-11-25 20:09:28,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:28,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408124751] [2021-11-25 20:09:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:28,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:28,086 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:28,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408124751] [2021-11-25 20:09:28,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408124751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:28,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:28,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:28,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874408056] [2021-11-25 20:09:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:28,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:28,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:28,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:28,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:28,096 INFO L87 Difference]: Start difference. First operand 379 states and 555 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:28,168 INFO L93 Difference]: Finished difference Result 646 states and 959 transitions. [2021-11-25 20:09:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:28,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:09:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:28,172 INFO L225 Difference]: With dead ends: 646 [2021-11-25 20:09:28,172 INFO L226 Difference]: Without dead ends: 360 [2021-11-25 20:09:28,174 INFO L932 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 [2021-11-25 20:09:28,176 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:28,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-25 20:09:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-11-25 20:09:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 269 states have (on average 1.3717472118959109) internal successors, (369), 274 states have internal predecessors, (369), 71 states have call successors, (71), 21 states have call predecessors, (71), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2021-11-25 20:09:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 528 transitions. [2021-11-25 20:09:28,227 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 528 transitions. Word has length 23 [2021-11-25 20:09:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:28,227 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 528 transitions. [2021-11-25 20:09:28,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 528 transitions. [2021-11-25 20:09:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:09:28,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:28,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:28,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:09:28,230 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1156263919, now seen corresponding path program 1 times [2021-11-25 20:09:28,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040875493] [2021-11-25 20:09:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:28,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:28,345 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:28,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040875493] [2021-11-25 20:09:28,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040875493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:28,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:28,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:28,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943384585] [2021-11-25 20:09:28,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:28,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:28,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:28,348 INFO L87 Difference]: Start difference. First operand 360 states and 528 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:28,629 INFO L93 Difference]: Finished difference Result 372 states and 539 transitions. [2021-11-25 20:09:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-25 20:09:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:28,634 INFO L225 Difference]: With dead ends: 372 [2021-11-25 20:09:28,634 INFO L226 Difference]: Without dead ends: 364 [2021-11-25 20:09:28,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:28,636 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 279 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:28,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 380 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-25 20:09:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2021-11-25 20:09:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 269 states have (on average 1.3680297397769516) internal successors, (368), 274 states have internal predecessors, (368), 71 states have call successors, (71), 21 states have call predecessors, (71), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2021-11-25 20:09:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 527 transitions. [2021-11-25 20:09:28,669 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 527 transitions. Word has length 21 [2021-11-25 20:09:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:28,671 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 527 transitions. [2021-11-25 20:09:28,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 527 transitions. [2021-11-25 20:09:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 20:09:28,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:28,673 INFO L514 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] [2021-11-25 20:09:28,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:09:28,674 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1751632997, now seen corresponding path program 1 times [2021-11-25 20:09:28,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:28,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761139166] [2021-11-25 20:09:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:28,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:28,720 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:28,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761139166] [2021-11-25 20:09:28,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761139166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:28,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:28,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:28,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994438152] [2021-11-25 20:09:28,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:28,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:28,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:28,722 INFO L87 Difference]: Start difference. First operand 360 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:28,794 INFO L93 Difference]: Finished difference Result 383 states and 557 transitions. [2021-11-25 20:09:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-11-25 20:09:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:28,798 INFO L225 Difference]: With dead ends: 383 [2021-11-25 20:09:28,798 INFO L226 Difference]: Without dead ends: 354 [2021-11-25 20:09:28,798 INFO L932 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 [2021-11-25 20:09:28,799 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:28,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 186 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-25 20:09:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-11-25 20:09:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 264 states have (on average 1.3522727272727273) internal successors, (357), 268 states have internal predecessors, (357), 70 states have call successors, (70), 21 states have call predecessors, (70), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2021-11-25 20:09:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 515 transitions. [2021-11-25 20:09:28,841 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 515 transitions. Word has length 22 [2021-11-25 20:09:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:28,841 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 515 transitions. [2021-11-25 20:09:28,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 515 transitions. [2021-11-25 20:09:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:09:28,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:28,843 INFO L514 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] [2021-11-25 20:09:28,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:09:28,843 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1542340409, now seen corresponding path program 1 times [2021-11-25 20:09:28,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:28,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398806654] [2021-11-25 20:09:28,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:28,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:28,886 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398806654] [2021-11-25 20:09:28,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398806654] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:28,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:28,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:28,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767619931] [2021-11-25 20:09:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:28,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:28,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:28,889 INFO L87 Difference]: Start difference. First operand 354 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:28,966 INFO L93 Difference]: Finished difference Result 368 states and 528 transitions. [2021-11-25 20:09:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:28,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-11-25 20:09:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:28,972 INFO L225 Difference]: With dead ends: 368 [2021-11-25 20:09:28,972 INFO L226 Difference]: Without dead ends: 352 [2021-11-25 20:09:28,972 INFO L932 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 [2021-11-25 20:09:28,975 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:28,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-25 20:09:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2021-11-25 20:09:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 263 states have (on average 1.349809885931559) internal successors, (355), 267 states have internal predecessors, (355), 69 states have call successors, (69), 21 states have call predecessors, (69), 19 states have return successors, (87), 64 states have call predecessors, (87), 62 states have call successors, (87) [2021-11-25 20:09:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 511 transitions. [2021-11-25 20:09:29,007 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 511 transitions. Word has length 23 [2021-11-25 20:09:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:29,007 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 511 transitions. [2021-11-25 20:09:29,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 511 transitions. [2021-11-25 20:09:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:09:29,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:29,009 INFO L514 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] [2021-11-25 20:09:29,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:09:29,009 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1306958918, now seen corresponding path program 1 times [2021-11-25 20:09:29,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:29,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344893185] [2021-11-25 20:09:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:29,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:29,055 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:29,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344893185] [2021-11-25 20:09:29,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344893185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:29,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:29,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:29,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379247900] [2021-11-25 20:09:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:29,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:29,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:29,057 INFO L87 Difference]: Start difference. First operand 352 states and 511 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:29,210 INFO L93 Difference]: Finished difference Result 522 states and 796 transitions. [2021-11-25 20:09:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:09:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:29,215 INFO L225 Difference]: With dead ends: 522 [2021-11-25 20:09:29,216 INFO L226 Difference]: Without dead ends: 514 [2021-11-25 20:09:29,216 INFO L932 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 [2021-11-25 20:09:29,217 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 139 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:29,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 370 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-11-25 20:09:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 397. [2021-11-25 20:09:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3557046979865772) internal successors, (404), 302 states have internal predecessors, (404), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-25 20:09:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 587 transitions. [2021-11-25 20:09:29,264 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 587 transitions. Word has length 23 [2021-11-25 20:09:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:29,265 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 587 transitions. [2021-11-25 20:09:29,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 587 transitions. [2021-11-25 20:09:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:09:29,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:29,269 INFO L514 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] [2021-11-25 20:09:29,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:09:29,269 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1407663317, now seen corresponding path program 1 times [2021-11-25 20:09:29,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557382967] [2021-11-25 20:09:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:29,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:29,346 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:29,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557382967] [2021-11-25 20:09:29,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557382967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:29,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:29,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:29,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910393114] [2021-11-25 20:09:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:29,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:29,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:29,349 INFO L87 Difference]: Start difference. First operand 397 states and 587 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:29,713 INFO L93 Difference]: Finished difference Result 522 states and 795 transitions. [2021-11-25 20:09:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 20:09:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:29,719 INFO L225 Difference]: With dead ends: 522 [2021-11-25 20:09:29,719 INFO L226 Difference]: Without dead ends: 514 [2021-11-25 20:09:29,720 INFO L932 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 [2021-11-25 20:09:29,721 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 379 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:29,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 303 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-11-25 20:09:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 397. [2021-11-25 20:09:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3523489932885906) internal successors, (403), 302 states have internal predecessors, (403), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-25 20:09:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 586 transitions. [2021-11-25 20:09:29,767 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 586 transitions. Word has length 24 [2021-11-25 20:09:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:29,768 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 586 transitions. [2021-11-25 20:09:29,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 586 transitions. [2021-11-25 20:09:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:09:29,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:29,771 INFO L514 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] [2021-11-25 20:09:29,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:09:29,771 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -636636042, now seen corresponding path program 1 times [2021-11-25 20:09:29,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:29,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108131992] [2021-11-25 20:09:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:29,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:29,812 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108131992] [2021-11-25 20:09:29,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108131992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:29,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:29,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:29,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086075945] [2021-11-25 20:09:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:29,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:29,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:29,814 INFO L87 Difference]: Start difference. First operand 397 states and 586 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:30,029 INFO L93 Difference]: Finished difference Result 421 states and 613 transitions. [2021-11-25 20:09:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 20:09:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:30,033 INFO L225 Difference]: With dead ends: 421 [2021-11-25 20:09:30,033 INFO L226 Difference]: Without dead ends: 397 [2021-11-25 20:09:30,035 INFO L932 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 [2021-11-25 20:09:30,036 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 212 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:30,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 273 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-25 20:09:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2021-11-25 20:09:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3456375838926173) internal successors, (401), 302 states have internal predecessors, (401), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2021-11-25 20:09:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 584 transitions. [2021-11-25 20:09:30,073 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 584 transitions. Word has length 24 [2021-11-25 20:09:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:30,074 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 584 transitions. [2021-11-25 20:09:30,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 584 transitions. [2021-11-25 20:09:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:09:30,076 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:30,076 INFO L514 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] [2021-11-25 20:09:30,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 20:09:30,076 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1878976399, now seen corresponding path program 1 times [2021-11-25 20:09:30,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:30,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933032412] [2021-11-25 20:09:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:30,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:30,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:30,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933032412] [2021-11-25 20:09:30,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933032412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:30,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:30,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:09:30,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88262567] [2021-11-25 20:09:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:30,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:30,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:30,114 INFO L87 Difference]: Start difference. First operand 397 states and 584 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:30,268 INFO L93 Difference]: Finished difference Result 444 states and 626 transitions. [2021-11-25 20:09:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-25 20:09:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:30,271 INFO L225 Difference]: With dead ends: 444 [2021-11-25 20:09:30,271 INFO L226 Difference]: Without dead ends: 266 [2021-11-25 20:09:30,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:30,273 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 229 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:30,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 350 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-25 20:09:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2021-11-25 20:09:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 193 states have (on average 1.2746113989637307) internal successors, (246), 198 states have internal predecessors, (246), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (45), 38 states have call predecessors, (45), 37 states have call successors, (45) [2021-11-25 20:09:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2021-11-25 20:09:30,297 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 28 [2021-11-25 20:09:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:30,297 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2021-11-25 20:09:30,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2021-11-25 20:09:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 20:09:30,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:30,299 INFO L514 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] [2021-11-25 20:09:30,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 20:09:30,299 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1584967708, now seen corresponding path program 1 times [2021-11-25 20:09:30,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:30,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681878167] [2021-11-25 20:09:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:30,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:30,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681878167] [2021-11-25 20:09:30,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681878167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:30,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:30,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:30,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645758939] [2021-11-25 20:09:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:30,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:30,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:30,333 INFO L87 Difference]: Start difference. First operand 252 states and 335 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:30,541 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-11-25 20:09:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 20:09:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:30,544 INFO L225 Difference]: With dead ends: 269 [2021-11-25 20:09:30,544 INFO L226 Difference]: Without dead ends: 249 [2021-11-25 20:09:30,544 INFO L932 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 [2021-11-25 20:09:30,545 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 213 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:30,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 266 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-25 20:09:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-11-25 20:09:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 190 states have (on average 1.268421052631579) internal successors, (241), 196 states have internal predecessors, (241), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-25 20:09:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2021-11-25 20:09:30,569 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 25 [2021-11-25 20:09:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:30,569 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2021-11-25 20:09:30,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2021-11-25 20:09:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 20:09:30,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:30,570 INFO L514 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] [2021-11-25 20:09:30,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 20:09:30,571 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash 781876277, now seen corresponding path program 1 times [2021-11-25 20:09:30,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:30,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246855562] [2021-11-25 20:09:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:30,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:30,597 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:30,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246855562] [2021-11-25 20:09:30,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246855562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:30,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:30,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:30,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612682991] [2021-11-25 20:09:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:30,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:30,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:30,598 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:30,734 INFO L93 Difference]: Finished difference Result 352 states and 490 transitions. [2021-11-25 20:09:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 20:09:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:30,737 INFO L225 Difference]: With dead ends: 352 [2021-11-25 20:09:30,738 INFO L226 Difference]: Without dead ends: 339 [2021-11-25 20:09:30,738 INFO L932 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 [2021-11-25 20:09:30,739 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 132 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:30,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 449 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-25 20:09:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 246. [2021-11-25 20:09:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.2553191489361701) internal successors, (236), 193 states have internal predecessors, (236), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-25 20:09:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 323 transitions. [2021-11-25 20:09:30,764 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 323 transitions. Word has length 25 [2021-11-25 20:09:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:30,764 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 323 transitions. [2021-11-25 20:09:30,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 323 transitions. [2021-11-25 20:09:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:09:30,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:30,765 INFO L514 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] [2021-11-25 20:09:30,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 20:09:30,766 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1078281712, now seen corresponding path program 1 times [2021-11-25 20:09:30,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:30,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681663866] [2021-11-25 20:09:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:30,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:30,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681663866] [2021-11-25 20:09:30,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681663866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:30,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:30,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:30,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693796383] [2021-11-25 20:09:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:30,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:30,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:30,937 INFO L87 Difference]: Start difference. First operand 246 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:31,108 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2021-11-25 20:09:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:09:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:09:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:31,112 INFO L225 Difference]: With dead ends: 260 [2021-11-25 20:09:31,112 INFO L226 Difference]: Without dead ends: 256 [2021-11-25 20:09:31,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:31,113 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 14 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:31,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 713 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-25 20:09:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2021-11-25 20:09:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 199 states have internal predecessors, (242), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-25 20:09:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 329 transitions. [2021-11-25 20:09:31,139 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 329 transitions. Word has length 26 [2021-11-25 20:09:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:31,140 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 329 transitions. [2021-11-25 20:09:31,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 329 transitions. [2021-11-25 20:09:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:09:31,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:31,141 INFO L514 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] [2021-11-25 20:09:31,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 20:09:31,142 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1078558542, now seen corresponding path program 1 times [2021-11-25 20:09:31,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:31,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126105123] [2021-11-25 20:09:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:31,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:31,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126105123] [2021-11-25 20:09:31,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126105123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:31,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:31,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:31,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545508416] [2021-11-25 20:09:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:31,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:09:31,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:09:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:09:31,198 INFO L87 Difference]: Start difference. First operand 252 states and 329 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:31,529 INFO L93 Difference]: Finished difference Result 347 states and 481 transitions. [2021-11-25 20:09:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:09:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:31,532 INFO L225 Difference]: With dead ends: 347 [2021-11-25 20:09:31,533 INFO L226 Difference]: Without dead ends: 327 [2021-11-25 20:09:31,533 INFO L932 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 [2021-11-25 20:09:31,534 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 297 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:31,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 377 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-25 20:09:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 240. [2021-11-25 20:09:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 182 states have (on average 1.2582417582417582) internal successors, (229), 187 states have internal predecessors, (229), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-25 20:09:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-11-25 20:09:31,561 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 26 [2021-11-25 20:09:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:31,562 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-11-25 20:09:31,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-11-25 20:09:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:09:31,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:31,563 INFO L514 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] [2021-11-25 20:09:31,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 20:09:31,563 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1736831101, now seen corresponding path program 1 times [2021-11-25 20:09:31,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:31,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150250560] [2021-11-25 20:09:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:31,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:31,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:31,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150250560] [2021-11-25 20:09:31,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150250560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:31,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:31,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:09:31,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635222847] [2021-11-25 20:09:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:31,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:09:31,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:09:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:31,631 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:31,801 INFO L93 Difference]: Finished difference Result 255 states and 331 transitions. [2021-11-25 20:09:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:09:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-25 20:09:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:31,804 INFO L225 Difference]: With dead ends: 255 [2021-11-25 20:09:31,804 INFO L226 Difference]: Without dead ends: 251 [2021-11-25 20:09:31,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:09:31,805 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 15 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:31,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 1005 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-25 20:09:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2021-11-25 20:09:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 194 states have internal predecessors, (236), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2021-11-25 20:09:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 323 transitions. [2021-11-25 20:09:31,830 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 323 transitions. Word has length 27 [2021-11-25 20:09:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:31,831 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 323 transitions. [2021-11-25 20:09:31,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 323 transitions. [2021-11-25 20:09:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:09:31,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:31,832 INFO L514 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] [2021-11-25 20:09:31,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 20:09:31,832 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1737107931, now seen corresponding path program 1 times [2021-11-25 20:09:31,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:31,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133552744] [2021-11-25 20:09:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:31,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:31,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133552744] [2021-11-25 20:09:31,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133552744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:31,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:31,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:31,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694693516] [2021-11-25 20:09:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:31,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:31,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:31,916 INFO L87 Difference]: Start difference. First operand 247 states and 323 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:32,284 INFO L93 Difference]: Finished difference Result 340 states and 472 transitions. [2021-11-25 20:09:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-25 20:09:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:32,288 INFO L225 Difference]: With dead ends: 340 [2021-11-25 20:09:32,288 INFO L226 Difference]: Without dead ends: 324 [2021-11-25 20:09:32,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:32,289 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 357 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:32,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 390 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-25 20:09:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 235. [2021-11-25 20:09:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.252808988764045) internal successors, (223), 183 states have internal predecessors, (223), 42 states have call successors, (42), 16 states have call predecessors, (42), 14 states have return successors, (43), 36 states have call predecessors, (43), 36 states have call successors, (43) [2021-11-25 20:09:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 308 transitions. [2021-11-25 20:09:32,315 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 308 transitions. Word has length 27 [2021-11-25 20:09:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:32,315 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 308 transitions. [2021-11-25 20:09:32,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 308 transitions. [2021-11-25 20:09:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:09:32,317 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:32,317 INFO L514 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] [2021-11-25 20:09:32,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 20:09:32,318 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1728736953, now seen corresponding path program 1 times [2021-11-25 20:09:32,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:32,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424589182] [2021-11-25 20:09:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:32,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:32,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:32,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424589182] [2021-11-25 20:09:32,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424589182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:32,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:32,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:09:32,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293839003] [2021-11-25 20:09:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:32,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:09:32,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:09:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:32,553 INFO L87 Difference]: Start difference. First operand 235 states and 308 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:32,748 INFO L93 Difference]: Finished difference Result 241 states and 313 transitions. [2021-11-25 20:09:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:09:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-25 20:09:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:32,750 INFO L225 Difference]: With dead ends: 241 [2021-11-25 20:09:32,751 INFO L226 Difference]: Without dead ends: 218 [2021-11-25 20:09:32,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:09:32,752 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 5 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:32,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1009 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-25 20:09:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2021-11-25 20:09:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.2699386503067485) internal successors, (207), 168 states have internal predecessors, (207), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (42), 35 states have call predecessors, (42), 35 states have call successors, (42) [2021-11-25 20:09:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2021-11-25 20:09:32,782 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 28 [2021-11-25 20:09:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:32,783 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2021-11-25 20:09:32,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2021-11-25 20:09:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:09:32,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:32,785 INFO L514 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] [2021-11-25 20:09:32,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 20:09:32,785 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1725917529, now seen corresponding path program 1 times [2021-11-25 20:09:32,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403912705] [2021-11-25 20:09:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:32,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:32,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:32,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403912705] [2021-11-25 20:09:32,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403912705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:32,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:32,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:32,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520020837] [2021-11-25 20:09:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:32,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:32,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:32,826 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:32,950 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2021-11-25 20:09:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:09:32,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-25 20:09:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:32,952 INFO L225 Difference]: With dead ends: 248 [2021-11-25 20:09:32,952 INFO L226 Difference]: Without dead ends: 216 [2021-11-25 20:09:32,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:09:32,954 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 34 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:32,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 657 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-25 20:09:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-25 20:09:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 167 states have internal predecessors, (204), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2021-11-25 20:09:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2021-11-25 20:09:32,984 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 28 [2021-11-25 20:09:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:32,984 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2021-11-25 20:09:32,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2021-11-25 20:09:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:09:32,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:32,986 INFO L514 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] [2021-11-25 20:09:32,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 20:09:32,986 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1931034124, now seen corresponding path program 1 times [2021-11-25 20:09:32,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:32,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937693716] [2021-11-25 20:09:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:32,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,026 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937693716] [2021-11-25 20:09:33,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937693716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:33,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538930690] [2021-11-25 20:09:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:33,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:33,029 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,109 INFO L93 Difference]: Finished difference Result 383 states and 527 transitions. [2021-11-25 20:09:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-11-25 20:09:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,114 INFO L225 Difference]: With dead ends: 383 [2021-11-25 20:09:33,114 INFO L226 Difference]: Without dead ends: 219 [2021-11-25 20:09:33,115 INFO L932 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 [2021-11-25 20:09:33,115 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-25 20:09:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2021-11-25 20:09:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 169 states have internal predecessors, (208), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2021-11-25 20:09:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2021-11-25 20:09:33,140 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 32 [2021-11-25 20:09:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,140 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2021-11-25 20:09:33,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2021-11-25 20:09:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:09:33,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,141 INFO L514 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] [2021-11-25 20:09:33,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 20:09:33,142 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 185455332, now seen corresponding path program 1 times [2021-11-25 20:09:33,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860945646] [2021-11-25 20:09:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,185 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860945646] [2021-11-25 20:09:33,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860945646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:09:33,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816346945] [2021-11-25 20:09:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:09:33,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:09:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:33,188 INFO L87 Difference]: Start difference. First operand 219 states and 289 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,308 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2021-11-25 20:09:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:09:33,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-25 20:09:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,311 INFO L225 Difference]: With dead ends: 221 [2021-11-25 20:09:33,311 INFO L226 Difference]: Without dead ends: 196 [2021-11-25 20:09:33,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:09:33,312 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 10 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 928 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-25 20:09:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-25 20:09:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.289655172413793) internal successors, (187), 148 states have internal predecessors, (187), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2021-11-25 20:09:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2021-11-25 20:09:33,332 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 32 [2021-11-25 20:09:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,332 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2021-11-25 20:09:33,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2021-11-25 20:09:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:09:33,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,334 INFO L514 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] [2021-11-25 20:09:33,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 20:09:33,334 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -105148121, now seen corresponding path program 1 times [2021-11-25 20:09:33,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500984159] [2021-11-25 20:09:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500984159] [2021-11-25 20:09:33,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500984159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:33,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039259708] [2021-11-25 20:09:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:33,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:33,365 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,457 INFO L93 Difference]: Finished difference Result 258 states and 355 transitions. [2021-11-25 20:09:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:33,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-25 20:09:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,460 INFO L225 Difference]: With dead ends: 258 [2021-11-25 20:09:33,460 INFO L226 Difference]: Without dead ends: 255 [2021-11-25 20:09:33,460 INFO L932 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 [2021-11-25 20:09:33,461 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 84 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 365 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-25 20:09:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 198. [2021-11-25 20:09:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 150 states have internal predecessors, (190), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2021-11-25 20:09:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2021-11-25 20:09:33,483 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 36 [2021-11-25 20:09:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,484 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2021-11-25 20:09:33,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2021-11-25 20:09:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:09:33,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,485 INFO L514 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] [2021-11-25 20:09:33,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 20:09:33,485 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1783499734, now seen corresponding path program 1 times [2021-11-25 20:09:33,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086293384] [2021-11-25 20:09:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086293384] [2021-11-25 20:09:33,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086293384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:33,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429678887] [2021-11-25 20:09:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:33,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:33,519 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,596 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2021-11-25 20:09:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:09:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-25 20:09:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,598 INFO L225 Difference]: With dead ends: 212 [2021-11-25 20:09:33,598 INFO L226 Difference]: Without dead ends: 184 [2021-11-25 20:09:33,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:33,599 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 23 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 601 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-25 20:09:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-11-25 20:09:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 138 states have internal predecessors, (176), 37 states have call successors, (37), 13 states have call predecessors, (37), 11 states have return successors, (39), 32 states have call predecessors, (39), 32 states have call successors, (39) [2021-11-25 20:09:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2021-11-25 20:09:33,630 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 32 [2021-11-25 20:09:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,631 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2021-11-25 20:09:33,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 20:09:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2021-11-25 20:09:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:09:33,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,632 INFO L514 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] [2021-11-25 20:09:33,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-25 20:09:33,632 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash 797328707, now seen corresponding path program 1 times [2021-11-25 20:09:33,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454797519] [2021-11-25 20:09:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454797519] [2021-11-25 20:09:33,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454797519] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:33,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98486551] [2021-11-25 20:09:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:33,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:33,667 INFO L87 Difference]: Start difference. First operand 184 states and 252 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,722 INFO L93 Difference]: Finished difference Result 416 states and 579 transitions. [2021-11-25 20:09:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-11-25 20:09:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,725 INFO L225 Difference]: With dead ends: 416 [2021-11-25 20:09:33,725 INFO L226 Difference]: Without dead ends: 250 [2021-11-25 20:09:33,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:33,727 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 243 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-25 20:09:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2021-11-25 20:09:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 164 states have internal predecessors, (214), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-25 20:09:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 308 transitions. [2021-11-25 20:09:33,749 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 308 transitions. Word has length 37 [2021-11-25 20:09:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,750 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 308 transitions. [2021-11-25 20:09:33,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 20:09:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 308 transitions. [2021-11-25 20:09:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:09:33,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,751 INFO L514 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] [2021-11-25 20:09:33,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-25 20:09:33,751 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1078882105, now seen corresponding path program 1 times [2021-11-25 20:09:33,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606869143] [2021-11-25 20:09:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:33,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606869143] [2021-11-25 20:09:33,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606869143] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:33,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:33,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 20:09:33,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586850792] [2021-11-25 20:09:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:33,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:09:33,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:09:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:33,858 INFO L87 Difference]: Start difference. First operand 223 states and 308 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:09:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:33,947 INFO L93 Difference]: Finished difference Result 424 states and 598 transitions. [2021-11-25 20:09:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:09:33,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2021-11-25 20:09:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:33,950 INFO L225 Difference]: With dead ends: 424 [2021-11-25 20:09:33,950 INFO L226 Difference]: Without dead ends: 216 [2021-11-25 20:09:33,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:33,951 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 13 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:33,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 651 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-25 20:09:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-25 20:09:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 157 states have internal predecessors, (203), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-25 20:09:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 296 transitions. [2021-11-25 20:09:33,977 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 296 transitions. Word has length 37 [2021-11-25 20:09:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:33,978 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 296 transitions. [2021-11-25 20:09:33,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 20:09:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 296 transitions. [2021-11-25 20:09:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-25 20:09:33,979 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:33,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:33,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-25 20:09:33,979 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1864106336, now seen corresponding path program 1 times [2021-11-25 20:09:33,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:33,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818001912] [2021-11-25 20:09:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:33,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:34,018 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818001912] [2021-11-25 20:09:34,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818001912] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:34,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:34,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:34,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367533252] [2021-11-25 20:09:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:34,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:34,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:34,020 INFO L87 Difference]: Start difference. First operand 216 states and 296 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 20:09:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:34,171 INFO L93 Difference]: Finished difference Result 417 states and 584 transitions. [2021-11-25 20:09:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:09:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-11-25 20:09:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:34,174 INFO L225 Difference]: With dead ends: 417 [2021-11-25 20:09:34,174 INFO L226 Difference]: Without dead ends: 216 [2021-11-25 20:09:34,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:34,176 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 143 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:34,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 283 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-25 20:09:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-11-25 20:09:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.270440251572327) internal successors, (202), 157 states have internal predecessors, (202), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2021-11-25 20:09:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2021-11-25 20:09:34,202 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 41 [2021-11-25 20:09:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:34,203 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2021-11-25 20:09:34,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 20:09:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2021-11-25 20:09:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 20:09:34,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:34,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-25 20:09:34,204 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 198602331, now seen corresponding path program 1 times [2021-11-25 20:09:34,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:34,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128160815] [2021-11-25 20:09:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:34,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:34,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:34,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128160815] [2021-11-25 20:09:34,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128160815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:34,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:34,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:09:34,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235270974] [2021-11-25 20:09:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:34,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:09:34,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:34,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:09:34,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:09:34,386 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 20:09:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:34,817 INFO L93 Difference]: Finished difference Result 246 states and 332 transitions. [2021-11-25 20:09:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:09:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2021-11-25 20:09:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:34,820 INFO L225 Difference]: With dead ends: 246 [2021-11-25 20:09:34,820 INFO L226 Difference]: Without dead ends: 242 [2021-11-25 20:09:34,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:09:34,821 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 338 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:34,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 416 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-25 20:09:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2021-11-25 20:09:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 161 states have internal predecessors, (205), 42 states have call successors, (42), 16 states have call predecessors, (42), 17 states have return successors, (55), 44 states have call predecessors, (55), 39 states have call successors, (55) [2021-11-25 20:09:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2021-11-25 20:09:34,850 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 42 [2021-11-25 20:09:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:34,850 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2021-11-25 20:09:34,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 20:09:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2021-11-25 20:09:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-25 20:09:34,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:34,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:34,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-25 20:09:34,852 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 959621875, now seen corresponding path program 1 times [2021-11-25 20:09:34,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:34,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150334747] [2021-11-25 20:09:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:34,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:34,949 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150334747] [2021-11-25 20:09:34,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150334747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:34,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:34,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:09:34,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775885717] [2021-11-25 20:09:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:34,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:09:34,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:34,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:09:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:09:34,953 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 20:09:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:35,299 INFO L93 Difference]: Finished difference Result 398 states and 541 transitions. [2021-11-25 20:09:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:09:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-11-25 20:09:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:35,301 INFO L225 Difference]: With dead ends: 398 [2021-11-25 20:09:35,301 INFO L226 Difference]: Without dead ends: 209 [2021-11-25 20:09:35,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:09:35,304 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:35,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 728 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-25 20:09:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-11-25 20:09:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.270967741935484) internal successors, (197), 153 states have internal predecessors, (197), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (45), 38 states have call predecessors, (45), 35 states have call successors, (45) [2021-11-25 20:09:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 280 transitions. [2021-11-25 20:09:35,330 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 280 transitions. Word has length 50 [2021-11-25 20:09:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:35,330 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 280 transitions. [2021-11-25 20:09:35,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 20:09:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 280 transitions. [2021-11-25 20:09:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-25 20:09:35,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:35,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:35,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-25 20:09:35,332 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1556211664, now seen corresponding path program 1 times [2021-11-25 20:09:35,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824563548] [2021-11-25 20:09:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:35,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:35,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824563548] [2021-11-25 20:09:35,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824563548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:35,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:35,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:09:35,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712185918] [2021-11-25 20:09:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:35,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:09:35,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:09:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:09:35,503 INFO L87 Difference]: Start difference. First operand 209 states and 280 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 20:09:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:35,722 INFO L93 Difference]: Finished difference Result 226 states and 296 transitions. [2021-11-25 20:09:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:09:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-11-25 20:09:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:35,725 INFO L225 Difference]: With dead ends: 226 [2021-11-25 20:09:35,725 INFO L226 Difference]: Without dead ends: 207 [2021-11-25 20:09:35,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:09:35,726 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 41 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:35,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 1405 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-25 20:09:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-25 20:09:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 152 states have internal predecessors, (196), 37 states have call successors, (37), 17 states have call predecessors, (37), 15 states have return successors, (43), 37 states have call predecessors, (43), 34 states have call successors, (43) [2021-11-25 20:09:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2021-11-25 20:09:35,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 58 [2021-11-25 20:09:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:35,768 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2021-11-25 20:09:35,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 20:09:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2021-11-25 20:09:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-25 20:09:35,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:35,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:35,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-25 20:09:35,769 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1240794923, now seen corresponding path program 1 times [2021-11-25 20:09:35,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:35,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104811874] [2021-11-25 20:09:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:35,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:35,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104811874] [2021-11-25 20:09:35,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104811874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:35,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:35,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:09:35,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643868824] [2021-11-25 20:09:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:35,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:09:35,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:09:35,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:09:35,915 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-25 20:09:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:36,158 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2021-11-25 20:09:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:09:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2021-11-25 20:09:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:36,161 INFO L225 Difference]: With dead ends: 318 [2021-11-25 20:09:36,161 INFO L226 Difference]: Without dead ends: 287 [2021-11-25 20:09:36,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:09:36,164 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:36,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1864 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-25 20:09:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 281. [2021-11-25 20:09:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 206 states have internal predecessors, (264), 58 states have call successors, (58), 17 states have call predecessors, (58), 15 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-11-25 20:09:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2021-11-25 20:09:36,198 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 63 [2021-11-25 20:09:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:36,198 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2021-11-25 20:09:36,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-25 20:09:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2021-11-25 20:09:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 20:09:36,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:36,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:36,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 20:09:36,206 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -129726516, now seen corresponding path program 1 times [2021-11-25 20:09:36,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599691523] [2021-11-25 20:09:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:36,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:36,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599691523] [2021-11-25 20:09:36,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599691523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:36,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:36,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:09:36,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233182273] [2021-11-25 20:09:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:36,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:09:36,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:09:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:09:36,316 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-25 20:09:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:36,574 INFO L93 Difference]: Finished difference Result 299 states and 407 transitions. [2021-11-25 20:09:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:09:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2021-11-25 20:09:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:36,578 INFO L225 Difference]: With dead ends: 299 [2021-11-25 20:09:36,578 INFO L226 Difference]: Without dead ends: 278 [2021-11-25 20:09:36,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:09:36,579 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 153 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:36,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 990 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-25 20:09:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2021-11-25 20:09:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 203 states have internal predecessors, (260), 56 states have call successors, (56), 17 states have call predecessors, (56), 15 states have return successors, (67), 55 states have call predecessors, (67), 52 states have call successors, (67) [2021-11-25 20:09:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 383 transitions. [2021-11-25 20:09:36,626 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 383 transitions. Word has length 65 [2021-11-25 20:09:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:36,626 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 383 transitions. [2021-11-25 20:09:36,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-25 20:09:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 383 transitions. [2021-11-25 20:09:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 20:09:36,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:36,628 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:36,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-25 20:09:36,629 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1450914883, now seen corresponding path program 1 times [2021-11-25 20:09:36,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:36,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319601049] [2021-11-25 20:09:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:36,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-25 20:09:36,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:36,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319601049] [2021-11-25 20:09:36,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319601049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:36,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:36,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:09:36,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049302743] [2021-11-25 20:09:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:36,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:09:36,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:09:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:09:36,858 INFO L87 Difference]: Start difference. First operand 276 states and 383 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-25 20:09:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:37,287 INFO L93 Difference]: Finished difference Result 324 states and 444 transitions. [2021-11-25 20:09:37,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:09:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2021-11-25 20:09:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:37,290 INFO L225 Difference]: With dead ends: 324 [2021-11-25 20:09:37,290 INFO L226 Difference]: Without dead ends: 317 [2021-11-25 20:09:37,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:09:37,291 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 291 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:37,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 395 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:09:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-25 20:09:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2021-11-25 20:09:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 58 states have call successors, (58), 18 states have call predecessors, (58), 16 states have return successors, (69), 55 states have call predecessors, (69), 54 states have call successors, (69) [2021-11-25 20:09:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2021-11-25 20:09:37,326 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 70 [2021-11-25 20:09:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:37,326 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2021-11-25 20:09:37,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-25 20:09:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2021-11-25 20:09:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 20:09:37,328 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:37,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:37,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-25 20:09:37,329 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1218407741, now seen corresponding path program 1 times [2021-11-25 20:09:37,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034393714] [2021-11-25 20:09:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:37,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:37,430 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:37,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034393714] [2021-11-25 20:09:37,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034393714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:37,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:37,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:09:37,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244055380] [2021-11-25 20:09:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:37,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:09:37,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:09:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:09:37,433 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-25 20:09:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:37,768 INFO L93 Difference]: Finished difference Result 288 states and 396 transitions. [2021-11-25 20:09:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:09:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2021-11-25 20:09:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:37,770 INFO L225 Difference]: With dead ends: 288 [2021-11-25 20:09:37,771 INFO L226 Difference]: Without dead ends: 249 [2021-11-25 20:09:37,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:09:37,772 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 221 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:37,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 1134 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-25 20:09:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2021-11-25 20:09:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 117 states have internal predecessors, (134), 33 states have call successors, (33), 16 states have call predecessors, (33), 14 states have return successors, (37), 28 states have call predecessors, (37), 30 states have call successors, (37) [2021-11-25 20:09:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2021-11-25 20:09:37,795 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 70 [2021-11-25 20:09:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:37,796 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2021-11-25 20:09:37,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-25 20:09:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2021-11-25 20:09:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-25 20:09:37,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:37,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:37,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-25 20:09:37,798 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 761882567, now seen corresponding path program 1 times [2021-11-25 20:09:37,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:37,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614792293] [2021-11-25 20:09:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:37,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-25 20:09:37,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614792293] [2021-11-25 20:09:37,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614792293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:37,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:37,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:09:37,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739082808] [2021-11-25 20:09:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:37,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:09:37,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:09:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:09:37,860 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-25 20:09:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:38,054 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2021-11-25 20:09:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:09:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2021-11-25 20:09:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:38,057 INFO L225 Difference]: With dead ends: 283 [2021-11-25 20:09:38,057 INFO L226 Difference]: Without dead ends: 171 [2021-11-25 20:09:38,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:09:38,058 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:38,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 260 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-25 20:09:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2021-11-25 20:09:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 109 states have internal predecessors, (120), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 20:09:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2021-11-25 20:09:38,083 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 78 [2021-11-25 20:09:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:38,083 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2021-11-25 20:09:38,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-25 20:09:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2021-11-25 20:09:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-25 20:09:38,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:38,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:38,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-25 20:09:38,086 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:38,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1944861011, now seen corresponding path program 1 times [2021-11-25 20:09:38,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:38,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507675667] [2021-11-25 20:09:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:38,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-25 20:09:38,365 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507675667] [2021-11-25 20:09:38,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507675667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:38,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:38,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:09:38,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778880450] [2021-11-25 20:09:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:38,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:09:38,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:09:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:09:38,369 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:09:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:38,694 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2021-11-25 20:09:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:09:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2021-11-25 20:09:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:38,697 INFO L225 Difference]: With dead ends: 198 [2021-11-25 20:09:38,697 INFO L226 Difference]: Without dead ends: 190 [2021-11-25 20:09:38,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:09:38,700 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 193 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:38,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 251 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-25 20:09:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2021-11-25 20:09:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 110 states have internal predecessors, (118), 28 states have call successors, (28), 19 states have call predecessors, (28), 15 states have return successors, (25), 20 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-25 20:09:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2021-11-25 20:09:38,722 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 99 [2021-11-25 20:09:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:38,723 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2021-11-25 20:09:38,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:09:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2021-11-25 20:09:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-25 20:09:38,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:38,730 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:38,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-25 20:09:38,730 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1350939513, now seen corresponding path program 1 times [2021-11-25 20:09:38,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:38,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691214911] [2021-11-25 20:09:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:38,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-25 20:09:39,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:39,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691214911] [2021-11-25 20:09:39,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691214911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:39,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261601513] [2021-11-25 20:09:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:39,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:39,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:39,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:39,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:09:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:39,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 20:09:39,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-25 20:09:39,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:09:39,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261601513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:39,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:09:39,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2021-11-25 20:09:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822627661] [2021-11-25 20:09:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:09:39,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:09:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:09:39,681 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-25 20:09:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:39,928 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2021-11-25 20:09:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:09:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 126 [2021-11-25 20:09:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:39,930 INFO L225 Difference]: With dead ends: 186 [2021-11-25 20:09:39,930 INFO L226 Difference]: Without dead ends: 178 [2021-11-25 20:09:39,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:09:39,931 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 151 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:39,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 417 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-25 20:09:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 135. [2021-11-25 20:09:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 24 states have call successors, (24), 16 states have call predecessors, (24), 14 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2021-11-25 20:09:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2021-11-25 20:09:39,981 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 126 [2021-11-25 20:09:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:39,982 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2021-11-25 20:09:39,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-25 20:09:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2021-11-25 20:09:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-25 20:09:39,984 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:39,984 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:40,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:09:40,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:40,204 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:09:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2119651962, now seen corresponding path program 1 times [2021-11-25 20:09:40,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:40,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693096013] [2021-11-25 20:09:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:40,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-25 20:09:40,463 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693096013] [2021-11-25 20:09:40,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693096013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:40,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:40,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:09:40,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37014906] [2021-11-25 20:09:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:40,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:09:40,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:09:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:09:40,465 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-25 20:09:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:40,783 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2021-11-25 20:09:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:09:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2021-11-25 20:09:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:40,784 INFO L225 Difference]: With dead ends: 164 [2021-11-25 20:09:40,784 INFO L226 Difference]: Without dead ends: 0 [2021-11-25 20:09:40,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:09:40,785 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 224 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:40,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 252 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:40,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-25 20:09:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-25 20:09:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-25 20:09:40,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2021-11-25 20:09:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:40,787 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-25 20:09:40,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-25 20:09:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-25 20:09:40,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-25 20:09:40,789 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 20:09:40,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-25 20:09:40,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-25 20:10:21,120 INFO L858 garLoopResultBuilder]: For program point IoBuildDeviceIoControlRequestEXIT(lines 834 858) no Hoare annotation was computed. [2021-11-25 20:10:21,120 INFO L854 garLoopResultBuilder]: At program point IoBuildDeviceIoControlRequestENTRY(lines 834 858) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (< 0 ~s~0)) (= |old(~customIrp~0)| ~customIrp~0) (= ~pended~0 1) (not (<= ~s~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2021-11-25 20:10:21,120 INFO L854 garLoopResultBuilder]: At program point L987(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 (and (= ~setEventCalled~0 1) (= ~customIrp~0 1) (= ~s~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))))) [2021-11-25 20:10:21,121 INFO L858 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 974 1015) no Hoare annotation was computed. [2021-11-25 20:10:21,121 INFO L858 garLoopResultBuilder]: For program point L979(lines 979 998) no Hoare annotation was computed. [2021-11-25 20:10:21,121 INFO L854 garLoopResultBuilder]: At program point L994(line 994) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))))) [2021-11-25 20:10:21,121 INFO L858 garLoopResultBuilder]: For program point L992(lines 992 996) no Hoare annotation was computed. [2021-11-25 20:10:21,122 INFO L854 garLoopResultBuilder]: At program point L992-1(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))) (let ((.cse11 (< 0 ~s~0)) (.cse12 (<= ~s~0 1))) (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 (and (= ~setEventCalled~0 1) .cse11 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 (= ~customIrp~0 1)))))) [2021-11-25 20:10:21,122 INFO L858 garLoopResultBuilder]: For program point L980(lines 980 985) no Hoare annotation was computed. [2021-11-25 20:10:21,122 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 974 1015) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse3 (= ~setEventCalled~0 1)) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse2 (= ~pended~0 1)) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= ~routine~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse10 (not (= 2 ~DC~0))) (.cse11 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse12 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= |old(~customIrp~0)| 1)) .cse2 (and .cse3 (= ~customIrp~0 1) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) .cse3 .cse4) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~MPR3~0 |old(~s~0)|))))) [2021-11-25 20:10:21,122 INFO L854 garLoopResultBuilder]: At program point L281(line 281) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (= |old(~pended~0)| 1)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= |old(~s~0)| 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= |old(~routine~0)| 0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse10 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0)))) (.cse11 (not (= 2 ~DC~0))) (.cse12 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (= 259 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (not (= ~pended~0 1)) (or .cse9 (and (<= ~s~0 1) (<= ~NP~0 ~s~0))) (= ~routine~0 0) (or (<= DiskPerfForwardIrpSynchronous_~status~3 258) .cse9) (= ~MPR3~0 ~s~0))) .cse10 .cse11 .cse12) (or .cse0 .cse1 (= |old(~customIrp~0)| ~customIrp~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))) [2021-11-25 20:10:21,122 INFO L858 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2021-11-25 20:10:21,123 INFO L858 garLoopResultBuilder]: For program point L279(lines 279 284) no Hoare annotation was computed. [2021-11-25 20:10:21,123 INFO L858 garLoopResultBuilder]: For program point L279-2(lines 279 284) no Hoare annotation was computed. [2021-11-25 20:10:21,123 INFO L858 garLoopResultBuilder]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 237 288) no Hoare annotation was computed. [2021-11-25 20:10:21,123 INFO L854 garLoopResultBuilder]: At program point L275(line 275) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~s~0 |old(~s~0)|)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-25 20:10:21,123 INFO L858 garLoopResultBuilder]: For program point L275-1(line 275) no Hoare annotation was computed. [2021-11-25 20:10:21,123 INFO L854 garLoopResultBuilder]: At program point L259(line 259) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-25 20:10:21,124 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 270) no Hoare annotation was computed. [2021-11-25 20:10:21,124 INFO L854 garLoopResultBuilder]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 237 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-25 20:10:21,124 INFO L854 garLoopResultBuilder]: At program point L264(line 264) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-11-25 20:10:21,124 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 269) no Hoare annotation was computed. [2021-11-25 20:10:21,124 INFO L858 garLoopResultBuilder]: For program point L262-1(lines 257 270) no Hoare annotation was computed. [2021-11-25 20:10:21,125 INFO L854 garLoopResultBuilder]: At program point L960(line 960) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= |old(~s~0)| 1))) (.cse3 (not (= ~routine~0 0))) (.cse4 (not (< 0 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0)) .cse1 .cse2 (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse3 .cse4 .cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 (= ~SKIP2~0 2) .cse2 (= ~IPC~0 2) .cse3 .cse4 .cse5))) [2021-11-25 20:10:21,125 INFO L858 garLoopResultBuilder]: For program point L960-1(lines 952 965) no Hoare annotation was computed. [2021-11-25 20:10:21,125 INFO L858 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-11-25 20:10:21,125 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 952 965) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= |old(~s~0)| 1))) (.cse3 (not (= ~routine~0 0))) (.cse4 (not (< 0 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (and (< 0 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) .cse1 (= ~SKIP2~0 2) .cse2 (= ~IPC~0 2) .cse3 .cse4 .cse5) (or .cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0)) .cse1 .cse2 (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse3 .cse4 .cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))))) [2021-11-25 20:10:21,125 INFO L858 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 952 965) no Hoare annotation was computed. [2021-11-25 20:10:21,125 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 52 59) the Hoare annotation is: true [2021-11-25 20:10:21,126 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 52 59) no Hoare annotation was computed. [2021-11-25 20:10:21,126 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-25 20:10:21,126 INFO L854 garLoopResultBuilder]: At program point L795(line 795) the Hoare annotation is: false [2021-11-25 20:10:21,126 INFO L854 garLoopResultBuilder]: At program point L630(lines 461 632) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,126 INFO L858 garLoopResultBuilder]: For program point L597(lines 597 599) no Hoare annotation was computed. [2021-11-25 20:10:21,126 INFO L854 garLoopResultBuilder]: At program point L564(lines 564 565) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse11 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= ~NP~0 1)) [2021-11-25 20:10:21,127 INFO L858 garLoopResultBuilder]: For program point L564-1(lines 564 565) no Hoare annotation was computed. [2021-11-25 20:10:21,127 INFO L854 garLoopResultBuilder]: At program point L1093(line 1093) the Hoare annotation is: false [2021-11-25 20:10:21,127 INFO L854 garLoopResultBuilder]: At program point L1093-1(lines 1072 1097) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (or (and (= 259 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (= 259 ~lowerDriverReturn~0)) (and (= ~lowerDriverReturn~0 0) (= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| 0)) (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) 0))) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-11-25 20:10:21,127 INFO L854 garLoopResultBuilder]: At program point L1028(line 1028) the Hoare annotation is: false [2021-11-25 20:10:21,127 INFO L858 garLoopResultBuilder]: For program point L1028-1(line 1028) no Hoare annotation was computed. [2021-11-25 20:10:21,127 INFO L854 garLoopResultBuilder]: At program point L831(lines 647 833) the Hoare annotation is: (= ~NP~0 1) [2021-11-25 20:10:21,128 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2021-11-25 20:10:21,128 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 132) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,128 INFO L854 garLoopResultBuilder]: At program point L601(line 601) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,128 INFO L858 garLoopResultBuilder]: For program point L601-1(line 601) no Hoare annotation was computed. [2021-11-25 20:10:21,128 INFO L854 garLoopResultBuilder]: At program point L535(lines 535 536) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse11 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= ~NP~0 1)) [2021-11-25 20:10:21,128 INFO L858 garLoopResultBuilder]: For program point L535-1(lines 535 536) no Hoare annotation was computed. [2021-11-25 20:10:21,129 INFO L858 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-11-25 20:10:21,129 INFO L858 garLoopResultBuilder]: For program point L1031-2(lines 1026 1036) no Hoare annotation was computed. [2021-11-25 20:10:21,129 INFO L858 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2021-11-25 20:10:21,129 INFO L854 garLoopResultBuilder]: At program point L404-2(lines 404 411) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,129 INFO L858 garLoopResultBuilder]: For program point L405(lines 404 411) no Hoare annotation was computed. [2021-11-25 20:10:21,129 INFO L854 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,130 INFO L854 garLoopResultBuilder]: At program point L207-1(line 207) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfSendToNextDriver_#t~ret23#1|) (= ~SKIP2~0 ~s~0)) [2021-11-25 20:10:21,130 INFO L854 garLoopResultBuilder]: At program point L108(lines 108 131) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,130 INFO L854 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: false [2021-11-25 20:10:21,130 INFO L858 garLoopResultBuilder]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2021-11-25 20:10:21,130 INFO L854 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,130 INFO L858 garLoopResultBuilder]: For program point L538(lines 538 540) no Hoare annotation was computed. [2021-11-25 20:10:21,131 INFO L858 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2021-11-25 20:10:21,131 INFO L858 garLoopResultBuilder]: For program point L605(lines 605 610) no Hoare annotation was computed. [2021-11-25 20:10:21,131 INFO L858 garLoopResultBuilder]: For program point L605-2(lines 526 624) no Hoare annotation was computed. [2021-11-25 20:10:21,131 INFO L854 garLoopResultBuilder]: At program point L1068(lines 1024 1099) the Hoare annotation is: (and (or (= 259 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| 0) (= (+ 1073741823 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) 0)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,131 INFO L854 garLoopResultBuilder]: At program point L804(lines 791 826) the Hoare annotation is: (let ((.cse10 (= 2 ~DC~0)) (.cse16 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0)) (.cse12 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse14 (<= 4 ~SKIP2~0)) (.cse4 (= ~s~0 ~DC~0)) (.cse6 (not (= ~pended~0 1))) (.cse11 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (= ~routine~0 0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse15 (= ~compRegistered~0 0)) (.cse5 (= 2 ~s~0))) (let ((.cse9 (not .cse5)) (.cse0 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse1 (or (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse10 .cse6 .cse11 .cse12 .cse7 .cse13 .cse8 .cse14 .cse15 .cse16) (and .cse12 .cse14 (or (and (= ~compRegistered~0 1) .cse4 .cse5 .cse6 .cse11 .cse7 .cse13 .cse8) (and .cse4 .cse5 .cse6 .cse11 .cse7 .cse13 .cse8 .cse15))))) (.cse2 (<= |ULTIMATE.start_main_~status~6#1| 258)) (.cse3 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse2 .cse3) (and (not (= ~SKIP2~0 2)) .cse4 .cse5 (= |ULTIMATE.start_main_~status~6#1| 0) .cse6 (not (= ~IPC~0 2)) .cse7 .cse8) (and .cse1 .cse9) (and (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse10 .cse6 .cse11 .cse9 .cse12 .cse7 .cse13 .cse8 .cse14 .cse15 .cse16) (and (or (and (< 0 (+ |ULTIMATE.start_main_~status~6#1| 1)) (<= |ULTIMATE.start_main_~status~6#1| 0) .cse16) (and (< 0 (+ 1073741824 |ULTIMATE.start_main_~status~6#1|)) (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741823) 0) .cse16) (and (<= |ULTIMATE.start_main_~status~6#1| 259) (< 258 |ULTIMATE.start_main_~status~6#1|) .cse16)) .cse10 .cse6 .cse11 .cse9 .cse12 .cse7 .cse13 .cse8 .cse14 .cse15) (and .cse1 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) .cse3)))) [2021-11-25 20:10:21,132 INFO L854 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,132 INFO L858 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2021-11-25 20:10:21,132 INFO L854 garLoopResultBuilder]: At program point L508(lines 508 509) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,132 INFO L858 garLoopResultBuilder]: For program point L508-1(lines 508 509) no Hoare annotation was computed. [2021-11-25 20:10:21,132 INFO L858 garLoopResultBuilder]: For program point L806(lines 806 810) no Hoare annotation was computed. [2021-11-25 20:10:21,132 INFO L854 garLoopResultBuilder]: At program point L707(lines 707 766) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,133 INFO L858 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2021-11-25 20:10:21,133 INFO L854 garLoopResultBuilder]: At program point L542(line 542) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,133 INFO L858 garLoopResultBuilder]: For program point L542-1(line 542) no Hoare annotation was computed. [2021-11-25 20:10:21,133 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,133 INFO L858 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2021-11-25 20:10:21,134 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 778) no Hoare annotation was computed. [2021-11-25 20:10:21,134 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-11-25 20:10:21,134 INFO L854 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: false [2021-11-25 20:10:21,134 INFO L854 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) (or (= ~s~0 ~NP~0) (= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp32~0#1| 259))) [2021-11-25 20:10:21,134 INFO L858 garLoopResultBuilder]: For program point L577-1(line 577) no Hoare annotation was computed. [2021-11-25 20:10:21,134 INFO L858 garLoopResultBuilder]: For program point L511(lines 511 513) no Hoare annotation was computed. [2021-11-25 20:10:21,135 INFO L854 garLoopResultBuilder]: At program point L412(lines 403 413) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,135 INFO L854 garLoopResultBuilder]: At program point L182(line 182) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2021-11-25 20:10:21,135 INFO L854 garLoopResultBuilder]: At program point L182-1(line 182) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2021-11-25 20:10:21,135 INFO L854 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: false [2021-11-25 20:10:21,135 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 551) no Hoare annotation was computed. [2021-11-25 20:10:21,135 INFO L858 garLoopResultBuilder]: For program point L546-2(lines 546 551) no Hoare annotation was computed. [2021-11-25 20:10:21,136 INFO L854 garLoopResultBuilder]: At program point L712(lines 712 765) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,136 INFO L858 garLoopResultBuilder]: For program point L1076(lines 1076 1096) no Hoare annotation was computed. [2021-11-25 20:10:21,136 INFO L858 garLoopResultBuilder]: For program point L812(lines 812 824) no Hoare annotation was computed. [2021-11-25 20:10:21,136 INFO L854 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) (or (and (< 0 ~s~0) (<= ~s~0 1)) (= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp27~0#1| 259))) [2021-11-25 20:10:21,136 INFO L854 garLoopResultBuilder]: At program point L515(line 515) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,136 INFO L858 garLoopResultBuilder]: For program point L548-1(line 548) no Hoare annotation was computed. [2021-11-25 20:10:21,137 INFO L858 garLoopResultBuilder]: For program point L515-1(line 515) no Hoare annotation was computed. [2021-11-25 20:10:21,137 INFO L854 garLoopResultBuilder]: At program point L449(line 449) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,137 INFO L854 garLoopResultBuilder]: At program point L449-1(line 449) the Hoare annotation is: (and (or (and (= ~lowerDriverReturn~0 0) (= |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret75#1| 0)) (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= (+ |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret75#1| 1073741823) 0)) (and (= 259 ~lowerDriverReturn~0) (= |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret75#1| 259))) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~s~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (= ~IPC~0 ~s~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,137 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-25 20:10:21,137 INFO L858 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-11-25 20:10:21,138 INFO L854 garLoopResultBuilder]: At program point L780(lines 773 830) the Hoare annotation is: (let ((.cse21 (+ ~SKIP2~0 3))) (let ((.cse10 (= ~compRegistered~0 0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse13 (= 2 ~s~0)) (.cse2 (not (= ~pended~0 1))) (.cse19 (<= .cse21 ~IPC~0)) (.cse14 (not (= ~IPC~0 2))) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1))) (let ((.cse15 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse16 (<= |ULTIMATE.start_main_~status~6#1| 258)) (.cse17 (or (and .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7 .cse10) (and (= ~compRegistered~0 1) .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7))) (.cse18 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258)) (.cse20 (= ~SKIP2~0 ~s~0)) (.cse1 (= 2 ~DC~0)) (.cse3 (<= .cse21 ~s~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~IPC~0 ~s~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse0 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0))) (or (and (or (and (< 0 (+ |ULTIMATE.start_main_~status~6#1| 1)) (<= |ULTIMATE.start_main_~status~6#1| 0) .cse0) (and (< 0 (+ 1073741824 |ULTIMATE.start_main_~status~6#1|)) (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741823) 0) .cse0) (and (<= |ULTIMATE.start_main_~status~6#1| 259) (< 258 |ULTIMATE.start_main_~status~6#1|) .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~status~6#1| 0) .cse2 .cse14 .cse5 .cse7) (and .cse15 .cse4 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse9 .cse16 .cse17 .cse18) (and .cse4 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse9 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse17) (and (= ~s~0 ~UNLOADED~0) .cse7) (and (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and .cse15 .cse4 .cse9 .cse16 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) .cse17 .cse18) (and .cse1 .cse2 .cse19 .cse4 .cse5 (or (and (= 259 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (= 259 ~lowerDriverReturn~0)) (and (= ~lowerDriverReturn~0 0) (= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| 0)) (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) 0))) .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0))))) [2021-11-25 20:10:21,138 INFO L858 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2021-11-25 20:10:21,138 INFO L854 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: false [2021-11-25 20:10:21,138 INFO L858 garLoopResultBuilder]: For program point L782(lines 782 786) no Hoare annotation was computed. [2021-11-25 20:10:21,138 INFO L854 garLoopResultBuilder]: At program point L683(lines 683 772) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~s~0 ~UNLOADED~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2021-11-25 20:10:21,138 INFO L858 garLoopResultBuilder]: For program point L683-1(lines 678 832) no Hoare annotation was computed. [2021-11-25 20:10:21,139 INFO L854 garLoopResultBuilder]: At program point L617(lines 613 622) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,139 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 227) no Hoare annotation was computed. [2021-11-25 20:10:21,139 INFO L854 garLoopResultBuilder]: At program point L717(lines 717 764) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,139 INFO L858 garLoopResultBuilder]: For program point L519(lines 519 524) no Hoare annotation was computed. [2021-11-25 20:10:21,139 INFO L858 garLoopResultBuilder]: For program point L519-2(lines 501 631) no Hoare annotation was computed. [2021-11-25 20:10:21,139 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 432) no Hoare annotation was computed. [2021-11-25 20:10:21,140 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 418) no Hoare annotation was computed. [2021-11-25 20:10:21,140 INFO L858 garLoopResultBuilder]: For program point L388-2(lines 388 418) no Hoare annotation was computed. [2021-11-25 20:10:21,140 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-25 20:10:21,140 INFO L854 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,140 INFO L854 garLoopResultBuilder]: At program point L157-1(line 157) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= |ULTIMATE.start_DiskPerfStartDevice_#t~ret12#1| 258) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-25 20:10:21,140 INFO L854 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) (or (= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp23~0#1| 259) (and (< 0 ~s~0) (<= ~s~0 1)))) [2021-11-25 20:10:21,141 INFO L858 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2021-11-25 20:10:21,141 INFO L854 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (< 0 ~s~0)) (.cse1 (= 2 ~DC~0)) (.cse2 (<= ~s~0 1)) (.cse3 (not (= ~pended~0 1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 1073741789) 0)))) [2021-11-25 20:10:21,141 INFO L858 garLoopResultBuilder]: For program point L422-1(line 422) no Hoare annotation was computed. [2021-11-25 20:10:21,141 INFO L858 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2021-11-25 20:10:21,141 INFO L858 garLoopResultBuilder]: For program point L555(lines 555 582) no Hoare annotation was computed. [2021-11-25 20:10:21,141 INFO L858 garLoopResultBuilder]: For program point L555-1(lines 526 624) no Hoare annotation was computed. [2021-11-25 20:10:21,142 INFO L854 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2021-11-25 20:10:21,142 INFO L858 garLoopResultBuilder]: For program point L225-1(lines 221 227) no Hoare annotation was computed. [2021-11-25 20:10:21,142 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: false [2021-11-25 20:10:21,142 INFO L854 garLoopResultBuilder]: At program point L788(lines 781 829) the Hoare annotation is: (let ((.cse21 (+ ~SKIP2~0 3))) (let ((.cse10 (= ~compRegistered~0 0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse13 (= 2 ~s~0)) (.cse2 (not (= ~pended~0 1))) (.cse19 (<= .cse21 ~IPC~0)) (.cse14 (not (= ~IPC~0 2))) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1))) (let ((.cse15 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse16 (<= |ULTIMATE.start_main_~status~6#1| 258)) (.cse17 (or (and .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7 .cse10) (and (= ~compRegistered~0 1) .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7))) (.cse18 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258)) (.cse20 (= ~SKIP2~0 ~s~0)) (.cse1 (= 2 ~DC~0)) (.cse3 (<= .cse21 ~s~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~IPC~0 ~s~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse0 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0))) (or (and (or (and (< 0 (+ |ULTIMATE.start_main_~status~6#1| 1)) (<= |ULTIMATE.start_main_~status~6#1| 0) .cse0) (and (< 0 (+ 1073741824 |ULTIMATE.start_main_~status~6#1|)) (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741823) 0) .cse0) (and (<= |ULTIMATE.start_main_~status~6#1| 259) (< 258 |ULTIMATE.start_main_~status~6#1|) .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~status~6#1| 0) .cse2 .cse14 .cse5 .cse7) (and .cse15 .cse4 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse9 .cse16 .cse17 .cse18) (and .cse4 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse9 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse17) (and (= ~s~0 ~UNLOADED~0) .cse7) (and (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and .cse15 .cse4 .cse9 .cse16 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) .cse17 .cse18) (and .cse1 .cse2 .cse19 .cse4 .cse5 (or (and (= 259 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (= 259 ~lowerDriverReturn~0)) (and (= ~lowerDriverReturn~0 0) (= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| 0)) (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) 0))) .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0))))) [2021-11-25 20:10:21,142 INFO L854 garLoopResultBuilder]: At program point L722(lines 722 763) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,143 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 559) no Hoare annotation was computed. [2021-11-25 20:10:21,143 INFO L858 garLoopResultBuilder]: For program point L789(lines 773 830) no Hoare annotation was computed. [2021-11-25 20:10:21,143 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2021-11-25 20:10:21,143 INFO L854 garLoopResultBuilder]: At program point L162(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,143 INFO L854 garLoopResultBuilder]: At program point L162-1(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) [2021-11-25 20:10:21,144 INFO L854 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~NP~0 1)) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)))) [2021-11-25 20:10:21,144 INFO L858 garLoopResultBuilder]: For program point L790(lines 790 827) no Hoare annotation was computed. [2021-11-25 20:10:21,144 INFO L858 garLoopResultBuilder]: For program point L526(lines 501 631) no Hoare annotation was computed. [2021-11-25 20:10:21,144 INFO L854 garLoopResultBuilder]: At program point L295(line 295) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~routine~0 0) (= ~NP~0 1) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,144 INFO L854 garLoopResultBuilder]: At program point L295-1(line 295) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~routine~0 0) (= ~NP~0 1) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,144 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 202) no Hoare annotation was computed. [2021-11-25 20:10:21,144 INFO L858 garLoopResultBuilder]: For program point L1088(lines 1088 1095) no Hoare annotation was computed. [2021-11-25 20:10:21,145 INFO L858 garLoopResultBuilder]: For program point L791(lines 791 826) no Hoare annotation was computed. [2021-11-25 20:10:21,145 INFO L854 garLoopResultBuilder]: At program point L593(lines 593 595) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse11 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= ~NP~0 1)) [2021-11-25 20:10:21,145 INFO L858 garLoopResultBuilder]: For program point L593-1(lines 593 595) no Hoare annotation was computed. [2021-11-25 20:10:21,145 INFO L858 garLoopResultBuilder]: For program point L792(lines 792 802) no Hoare annotation was computed. [2021-11-25 20:10:21,145 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2021-11-25 20:10:21,145 INFO L854 garLoopResultBuilder]: At program point L429(line 429) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,146 INFO L858 garLoopResultBuilder]: For program point L429-1(line 429) no Hoare annotation was computed. [2021-11-25 20:10:21,146 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2021-11-25 20:10:21,146 INFO L854 garLoopResultBuilder]: At program point L760(lines 683 772) the Hoare annotation is: (let ((.cse21 (+ ~SKIP2~0 3))) (let ((.cse10 (= ~compRegistered~0 0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse13 (= 2 ~s~0)) (.cse2 (not (= ~pended~0 1))) (.cse19 (<= .cse21 ~IPC~0)) (.cse14 (not (= ~IPC~0 2))) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1))) (let ((.cse15 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse16 (<= |ULTIMATE.start_main_~status~6#1| 258)) (.cse17 (or (and .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7 .cse10) (and (= ~compRegistered~0 1) .cse11 .cse12 .cse13 .cse2 .cse19 .cse14 .cse5 .cse6 .cse7))) (.cse18 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258)) (.cse20 (= ~SKIP2~0 ~s~0)) (.cse1 (= 2 ~DC~0)) (.cse3 (<= .cse21 ~s~0)) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~IPC~0 ~s~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse0 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0))) (or (and (or (and (< 0 (+ |ULTIMATE.start_main_~status~6#1| 1)) (<= |ULTIMATE.start_main_~status~6#1| 0) .cse0) (and (< 0 (+ 1073741824 |ULTIMATE.start_main_~status~6#1|)) (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741823) 0) .cse0) (and (<= |ULTIMATE.start_main_~status~6#1| 259) (< 258 |ULTIMATE.start_main_~status~6#1|) .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~status~6#1| 0) .cse2 .cse14 .cse5 .cse7) (and .cse15 .cse4 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse9 .cse16 .cse17 .cse18) (and .cse4 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse9 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse17) (and (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and .cse15 .cse4 .cse9 .cse16 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) .cse17 .cse18) (and .cse1 .cse2 .cse19 .cse4 .cse5 (or (and (= 259 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (= 259 ~lowerDriverReturn~0)) (and (= ~lowerDriverReturn~0 0) (= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| 0)) (and (= (+ ~lowerDriverReturn~0 1073741823) 0) (= (+ 1073741823 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) 0))) .cse6 .cse7 .cse9 .cse10 .cse20 .cse0) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0))))) [2021-11-25 20:10:21,146 INFO L854 garLoopResultBuilder]: At program point L727(lines 727 762) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,147 INFO L854 garLoopResultBuilder]: At program point L397(line 397) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,147 INFO L858 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2021-11-25 20:10:21,147 INFO L854 garLoopResultBuilder]: At program point L133(lines 96 135) the Hoare annotation is: (let ((.cse7 (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258)) (.cse8 (= ~compRegistered~0 1)) (.cse9 (= ~s~0 ~DC~0)) (.cse10 (= 2 ~s~0)) (.cse0 (not (= ~pended~0 1))) (.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse2 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (<= 4 ~SKIP2~0)) (.cse11 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (or (and (= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) (= 2 ~DC~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) (and .cse7 .cse8 .cse9 .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258) .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258) .cse11))) [2021-11-25 20:10:21,147 INFO L858 garLoopResultBuilder]: For program point L1025(lines 1025 1045) no Hoare annotation was computed. [2021-11-25 20:10:21,147 INFO L854 garLoopResultBuilder]: At program point L1025-1(lines 1025 1045) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-25 20:10:21,147 INFO L854 garLoopResultBuilder]: At program point L431(lines 354 435) the Hoare annotation is: (let ((.cse10 (+ ~SKIP2~0 3))) (let ((.cse0 (= ~s~0 ~DC~0)) (.cse1 (= 2 ~s~0)) (.cse3 (<= .cse10 ~IPC~0)) (.cse2 (not (= ~pended~0 1))) (.cse4 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) (= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse9) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) (= 2 ~DC~0) .cse2 (<= .cse10 ~s~0) .cse4 .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8 .cse9)))) [2021-11-25 20:10:21,148 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-11-25 20:10:21,148 INFO L858 garLoopResultBuilder]: For program point L200-1(lines 196 202) no Hoare annotation was computed. [2021-11-25 20:10:21,148 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1036) no Hoare annotation was computed. [2021-11-25 20:10:21,148 INFO L858 garLoopResultBuilder]: For program point L882(lines 882 890) no Hoare annotation was computed. [2021-11-25 20:10:21,148 INFO L858 garLoopResultBuilder]: For program point L882-2(lines 882 890) no Hoare annotation was computed. [2021-11-25 20:10:21,148 INFO L854 garLoopResultBuilder]: At program point L944(line 944) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse1 (not (<= .cse11 ~SKIP1~0))) (.cse4 (not (<= |old(~s~0)| 1))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse0 (not (= ~NP~0 1))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse7 (not (= ~routine~0 0))) (.cse9 (not (= 2 ~DC~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse9 .cse10 (not (= ~compRegistered~0 1))) (or (not (<= .cse11 |old(~s~0)|)) .cse0 .cse2 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse9 .cse10)))) [2021-11-25 20:10:21,149 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 926 948) no Hoare annotation was computed. [2021-11-25 20:10:21,149 INFO L854 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse13 (+ 2 ~NP~0))) (let ((.cse3 (not (<= .cse13 ~SKIP1~0))) (.cse5 (not (<= |old(~s~0)| 1))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (< 0 |old(~s~0)|))) (.cse2 (not (= ~NP~0 1))) (.cse12 (not (= ~compRegistered~0 0))) (.cse4 (= |old(~pended~0)| 1)) (.cse6 (not (<= 4 ~SKIP2~0))) (.cse8 (not (= ~routine~0 0))) (.cse10 (not (= 2 ~DC~0))) (.cse11 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (let ((.cse1 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse0 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse0 0) (not (= ~pended~0 1)) (<= 0 .cse1) (<= .cse1 0) (<= 0 .cse0) (= ~s~0 |old(~s~0)|))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse10 .cse11 (not (= ~compRegistered~0 1))) (or .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (<= .cse13 |old(~s~0)|)) .cse2 .cse12 .cse4 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse6 .cse8 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11)))) [2021-11-25 20:10:21,149 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 873 951) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= .cse11 ~SKIP1~0))) (.cse0 (not (= ~pended~0 1))) (.cse12 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse4 (not (<= |old(~s~0)| 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= ~routine~0 0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse9 (not (= 2 ~DC~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and .cse0 (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse9 .cse10 (not (= ~compRegistered~0 1))) (or (not (<= .cse11 |old(~s~0)|)) .cse1 .cse12 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 (and .cse0 (= ~SKIP1~0 ~s~0)) .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse9 .cse10) (or .cse1 .cse2 (and (< 0 ~s~0) (<= ~s~0 1) .cse0) .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2021-11-25 20:10:21,149 INFO L854 garLoopResultBuilder]: At program point L888(line 888) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse1 (not (<= .cse11 ~SKIP1~0))) (.cse4 (not (<= |old(~s~0)| 1))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse0 (not (= ~NP~0 1))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse7 (not (= ~routine~0 0))) (.cse9 (not (= 2 ~DC~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse9 .cse10 (not (= ~compRegistered~0 1))) (or (not (<= .cse11 |old(~s~0)|)) .cse0 .cse2 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse5 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse9 .cse10)))) [2021-11-25 20:10:21,150 INFO L858 garLoopResultBuilder]: For program point L888-1(line 888) no Hoare annotation was computed. [2021-11-25 20:10:21,150 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 873 951) no Hoare annotation was computed. [2021-11-25 20:10:21,150 INFO L854 garLoopResultBuilder]: At program point L884(line 884) the Hoare annotation is: (let ((.cse11 (+ 2 ~NP~0))) (let ((.cse1 (not (<= .cse11 ~SKIP1~0))) (.cse3 (not (<= |old(~s~0)| 1))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (< 0 |old(~s~0)|))) (.cse0 (not (= ~NP~0 1))) (.cse10 (not (= ~compRegistered~0 0))) (.cse2 (= |old(~pended~0)| 1)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse6 (not (= ~routine~0 0))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (not (= ~pended~0 1)) (= ~s~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse8 .cse9 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (not (<= .cse11 |old(~s~0)|)) .cse0 .cse10 .cse2 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse4 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9)))) [2021-11-25 20:10:21,150 INFO L858 garLoopResultBuilder]: For program point L884-1(line 884) no Hoare annotation was computed. [2021-11-25 20:10:21,150 INFO L858 garLoopResultBuilder]: For program point L930(lines 930 947) no Hoare annotation was computed. [2021-11-25 20:10:21,150 INFO L858 garLoopResultBuilder]: For program point L893(lines 893 897) no Hoare annotation was computed. [2021-11-25 20:10:21,151 INFO L854 garLoopResultBuilder]: At program point L922(lines 880 950) the Hoare annotation is: (let ((.cse15 (+ 2 ~NP~0)) (.cse16 (= IofCallDriver_~returnVal2~0 0)) (.cse17 (= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)) (.cse18 (= 259 IofCallDriver_~returnVal2~0))) (let ((.cse3 (or .cse16 .cse17 .cse18)) (.cse5 (not (= ~pended~0 1))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= .cse15 ~SKIP1~0))) (.cse14 (not (= ~compRegistered~0 0))) (.cse2 (= |old(~pended~0)| 1)) (.cse7 (not (<= |old(~s~0)| 1))) (.cse8 (not (<= 4 ~SKIP2~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (= ~routine~0 0))) (.cse11 (not (< 0 |old(~s~0)|))) (.cse12 (not (= 2 ~DC~0))) (.cse13 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 (let ((.cse6 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse4 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and .cse3 (= ~setEventCalled~0 1) (<= .cse4 0) .cse5 (<= 0 .cse6) (<= .cse6 0) (<= 0 .cse4) (= ~MPR1~0 ~s~0))) .cse7 .cse8 .cse9 .cse10 .cse11 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse12 .cse13 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 (and (< 0 ~s~0) (<= ~s~0 1) .cse5) .cse14 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (<= .cse15 |old(~s~0)|)) .cse0 .cse14 .cse2 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse8 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 (and .cse3 .cse5 (= ~SKIP1~0 ~s~0)) .cse13) (or .cse0 .cse1 .cse16 .cse17 .cse14 .cse2 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-11-25 20:10:21,151 INFO L858 garLoopResultBuilder]: For program point L881(lines 881 899) no Hoare annotation was computed. [2021-11-25 20:10:21,151 INFO L854 garLoopResultBuilder]: At program point L881-1(lines 881 899) the Hoare annotation is: (let ((.cse0 (+ 2 ~NP~0))) (let ((.cse1 (not (= ~NP~0 1))) (.cse9 (not (<= .cse0 ~SKIP1~0))) (.cse5 (not (= ~pended~0 1))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse12 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse13 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse14 (not (< 0 |old(~s~0)|))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= .cse0 |old(~s~0)|)) .cse1 .cse2 .cse3 (not (<= (+ 2 |old(~s~0)|) ~MPR1~0)) .cse4 (and .cse5 (= ~SKIP1~0 ~s~0)) .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse1 .cse9 (let ((.cse11 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse10 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse10 0) .cse5 (<= 0 .cse11) (<= .cse11 0) (<= 0 .cse10) (= ~MPR1~0 ~s~0))) .cse3 .cse12 .cse4 .cse13 .cse6 .cse14 (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse7 .cse8 (not (= ~compRegistered~0 1))) (or .cse1 .cse9 (and (< 0 ~s~0) (<= ~s~0 1) .cse5) .cse2 .cse3 .cse12 .cse4 .cse13 .cse6 .cse14 .cse7 .cse8)))) [2021-11-25 20:10:21,151 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 946) no Hoare annotation was computed. [2021-11-25 20:10:21,152 INFO L858 garLoopResultBuilder]: For program point DiskPerfIrpCompletionEXIT(lines 136 146) no Hoare annotation was computed. [2021-11-25 20:10:21,152 INFO L861 garLoopResultBuilder]: At program point DiskPerfIrpCompletionENTRY(lines 136 146) the Hoare annotation is: true [2021-11-25 20:10:21,152 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 859 872) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= ~pended~0 1) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2021-11-25 20:10:21,152 INFO L858 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 859 872) no Hoare annotation was computed. [2021-11-25 20:10:21,152 INFO L854 garLoopResultBuilder]: At program point L867(line 867) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (= ~pended~0 1) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (and (not (= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2021-11-25 20:10:21,152 INFO L858 garLoopResultBuilder]: For program point L867-1(lines 859 872) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 320) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 350) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point DiskPerfIoCompletionFINAL(lines 300 353) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L861 garLoopResultBuilder]: At program point L346(line 346) the Hoare annotation is: true [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 348) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point DiskPerfIoCompletionEXIT(lines 300 353) no Hoare annotation was computed. [2021-11-25 20:10:21,153 INFO L858 garLoopResultBuilder]: For program point L336-1(lines 317 352) no Hoare annotation was computed. [2021-11-25 20:10:21,154 INFO L861 garLoopResultBuilder]: At program point DiskPerfIoCompletionENTRY(lines 300 353) the Hoare annotation is: true [2021-11-25 20:10:21,157 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-25 20:10:21,158 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 20:10:21,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:10:21 BoogieIcfgContainer [2021-11-25 20:10:21,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 20:10:21,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 20:10:21,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 20:10:21,215 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 20:10:21,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:09:25" (3/4) ... [2021-11-25 20:10:21,218 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-25 20:10:21,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-11-25 20:10:21,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-11-25 20:10:21,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-11-25 20:10:21,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-11-25 20:10:21,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-11-25 20:10:21,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-11-25 20:10:21,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-11-25 20:10:21,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-11-25 20:10:21,225 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-11-25 20:10:21,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2021-11-25 20:10:21,245 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2021-11-25 20:10:21,247 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-25 20:10:21,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-25 20:10:21,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) [2021-11-25 20:10:21,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) [2021-11-25 20:10:21,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((status <= 258 && (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))))) && status <= 258) && status <= 258) && \result <= 258) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0)))) && !(2 == s))) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn)) || ((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || (((((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0)))) && status + 1073741789 <= 0) && 1073741789 + \result <= 0)) || ((((status <= 258 && (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))))) && status <= 258) && status <= 258) && \result <= 258) [2021-11-25 20:10:21,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && 0 < s) && s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || ((0 < s && s <= 1) && customIrp == 1)) [2021-11-25 20:10:21,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(2 + NP <= \old(s)) || !(NP == 1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) && ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) [2021-11-25 20:10:21,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status == 0) && \result == 0) && compRegistered == 0) || ((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && 1073741789 + \result <= 0) && compRegistered == 0)) || ((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) [2021-11-25 20:10:21,279 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) [2021-11-25 20:10:21,280 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status <= 258) && NP == 1) && 4 <= SKIP2) && \result <= 258)) || ((((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258) && \result <= 258) [2021-11-25 20:10:21,280 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || \old(pended) == 1) || (((((((((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2) && setEventCalled == 1) && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && ((((((((((!(2 + NP <= \old(s)) || !(NP == 1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || !(4 <= SKIP2)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || ((((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2) && !(pended == 1)) && SKIP1 == s)) || !(SKIP2 + 3 <= IPC))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || returnVal2 == 0) || 1073741823 + returnVal2 == 0) || !(compRegistered == 0)) || \old(pended) == 1) || 259 == returnVal2) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) [2021-11-25 20:10:21,281 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) [2021-11-25 20:10:21,282 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(0 < s)) || \old(customIrp) == customIrp) || pended == 1) || !(s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) [2021-11-25 20:10:21,393 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 20:10:21,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 20:10:21,395 INFO L158 Benchmark]: Toolchain (without parser) took 57602.37ms. Allocated memory was 119.5MB in the beginning and 423.6MB in the end (delta: 304.1MB). Free memory was 77.9MB in the beginning and 307.4MB in the end (delta: -229.5MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,396 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 119.5MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:10:21,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.40ms. Allocated memory is still 119.5MB. Free memory was 77.7MB in the beginning and 83.9MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.85ms. Allocated memory is still 119.5MB. Free memory was 83.9MB in the beginning and 79.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,397 INFO L158 Benchmark]: Boogie Preprocessor took 60.78ms. Allocated memory is still 119.5MB. Free memory was 79.5MB in the beginning and 76.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,397 INFO L158 Benchmark]: RCFGBuilder took 1247.97ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 76.4MB in the beginning and 117.9MB in the end (delta: -41.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,398 INFO L158 Benchmark]: TraceAbstraction took 55428.70ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 117.9MB in the beginning and 328.6MB in the end (delta: -210.6MB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,398 INFO L158 Benchmark]: Witness Printer took 177.98ms. Allocated memory is still 423.6MB. Free memory was 328.6MB in the beginning and 307.4MB in the end (delta: 21.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-25 20:10:21,399 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.28ms. Allocated memory is still 119.5MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.40ms. Allocated memory is still 119.5MB. Free memory was 77.7MB in the beginning and 83.9MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.85ms. Allocated memory is still 119.5MB. Free memory was 83.9MB in the beginning and 79.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.78ms. Allocated memory is still 119.5MB. Free memory was 79.5MB in the beginning and 76.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1247.97ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 76.4MB in the beginning and 117.9MB in the end (delta: -41.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * TraceAbstraction took 55428.70ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 117.9MB in the beginning and 328.6MB in the end (delta: -210.6MB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. * Witness Printer took 177.98ms. Allocated memory is still 423.6MB. Free memory was 328.6MB in the beginning and 307.4MB in the end (delta: 21.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.3s, OverallIterations: 39, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5972 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5901 mSDsluCounter, 20776 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15581 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6895 IncrementalHoareTripleChecker+Invalid, 7610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 6929 mSDtfsCounter, 6895 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 201 SyntacticMatches, 5 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=10, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 901 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 1341 PreInvPairs, 1499 NumberOfFragments, 7690 HoareAnnotationTreeSize, 1341 FomulaSimplifications, 6761 FormulaSimplificationTreeSizeReduction, 29.1s HoareSimplificationTime, 87 FomulaSimplificationsInter, 1491121 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1691 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1651 ConstructedInterpolants, 0 QuantifiedInterpolants, 4771 SizeOfPredicates, 6 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 39 PerfectInterpolantSequences, 426/434 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1072]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && lowerDriverReturn == aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux) && SKIP2 == s - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((((status <= 258 && (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))))) && status <= 258) && status <= 258) && \result <= 258) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0)))) && !(2 == s))) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn)) || ((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || (((((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0)))) && status + 1073741789 <= 0) && 1073741789 + \result <= 0)) || ((((status <= 258 && (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) || ((2 + NP <= SKIP1 && 4 <= SKIP2) && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))))) && status <= 258) && status <= 258) && \result <= 258) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && 0 < s) && s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || ((0 < s && s <= 1) && customIrp == 1)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status <= 258) && NP == 1) && 4 <= SKIP2) && \result <= 258)) || ((((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258) && \result <= 258) - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && s == UNLOADED) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status <= 258) && NP == 1) && 4 <= SKIP2) || (((((((((((status <= 258 && compRegistered == 1) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || \old(pended) == 1) || (((((((((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2) && setEventCalled == 1) && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && ((((((((((!(2 + NP <= \old(s)) || !(NP == 1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || !(4 <= SKIP2)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || ((((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2) && !(pended == 1)) && SKIP1 == s)) || !(SKIP2 + 3 <= IPC))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || returnVal2 == 0) || 1073741823 + returnVal2 == 0) || !(compRegistered == 0)) || \old(pended) == 1) || 259 == returnVal2) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258 - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux <= 258) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: (((((((((((259 == returnVal || returnVal == 0) || 1073741823 + returnVal == 0) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 647]: Loop Invariant Derived loop invariant: NP == 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status == 0) && \result == 0) && compRegistered == 0) || ((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && 1073741789 + \result <= 0) && compRegistered == 0)) || ((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == 0 && aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux == 0) || (lowerDriverReturn + 1073741823 == 0 && aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux + 1073741823 == 0)) || (259 == lowerDriverReturn && aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux == 259)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(0 < s)) || \old(customIrp) == customIrp) || pended == 1) || !(s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 < status + 1 && status <= 0) && status == lowerDriverReturn) || ((0 < 1073741824 + status && status + 1073741823 <= 0) && status == lowerDriverReturn)) || ((status <= 259 && 258 < status) && status == lowerDriverReturn)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((((status <= 258 && 2 + NP <= SKIP1) && status <= 258) && 4 <= SKIP2) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((\result == lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || ((((((status <= 258 && 2 + NP <= SKIP1) && 4 <= SKIP2) && status <= 258) && status <= 258) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1))) && \result <= 258)) || (((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (((259 == returnVal && 259 == lowerDriverReturn) || (lowerDriverReturn == 0 && returnVal == 0)) || (lowerDriverReturn + 1073741823 == 0 && 1073741823 + returnVal == 0))) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn)) || (((((((((((lowerDriverReturn == \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) && status == lowerDriverReturn) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status <= 258 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && status <= 258) && NP == 1) && 4 <= SKIP2 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1) && compRegistered == 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: (((((((((((!(2 + NP <= \old(s)) || !(NP == 1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(2 + \old(s) <= MPR1)) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) && ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || (!(myStatus + 1073741637 == 0) && !(myStatus == 0))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) RESULT: Ultimate proved your program to be correct! [2021-11-25 20:10:21,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67bee75b-275d-4e93-8c72-f505f3b6850e/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE