./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI --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 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:16:46,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:16:46,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:16:46,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:16:46,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:16:46,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:16:46,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:16:46,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:16:46,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:16:46,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:16:46,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:16:46,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:16:46,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:16:46,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:16:46,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:16:46,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:16:46,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:16:46,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:16:46,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:16:46,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:16:46,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:16:46,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:16:46,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:16:46,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:16:46,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:16:46,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:16:46,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:16:46,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:16:46,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:16:46,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:16:46,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:16:46,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:16:46,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:16:46,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:16:46,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:16:46,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:16:46,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:16:46,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:16:46,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:16:46,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:16:46,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:16:46,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:16:46,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:16:46,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:16:46,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:16:46,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:16:46,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:16:46,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:16:46,495 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:16:46,496 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:16:46,496 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:16:46,496 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:16:46,497 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:16:46,498 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:16:46,498 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:16:46,498 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:16:46,498 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:16:46,499 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:16:46,499 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:16:46,499 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:16:46,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:16:46,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:16:46,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:16:46,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:16:46,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:16:46,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:16:46,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:16:46,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:16:46,503 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:16:46,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:16:46,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:16:46,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:16:46,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:16:46,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:16:46,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:16:46,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:16:46,506 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:16:46,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:16:46,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:16:46,507 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:16:46,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:16:46,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:16:46,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:16:46,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/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_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI 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 -> 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe [2022-11-03 02:16:46,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:16:46,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:16:46,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:16:46,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:16:46,896 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:16:46,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-03 02:16:46,978 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/data/70d8ca3f7/fa75e4f115de499791055fc1e68abafc/FLAG6916f9764 [2022-11-03 02:16:47,585 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:16:47,585 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-03 02:16:47,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/data/70d8ca3f7/fa75e4f115de499791055fc1e68abafc/FLAG6916f9764 [2022-11-03 02:16:47,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/data/70d8ca3f7/fa75e4f115de499791055fc1e68abafc [2022-11-03 02:16:47,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:16:47,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:16:47,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:16:47,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:16:47,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:16:47,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:16:47" (1/1) ... [2022-11-03 02:16:47,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e91ddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:47, skipping insertion in model container [2022-11-03 02:16:47,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:16:47" (1/1) ... [2022-11-03 02:16:47,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:16:48,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:16:48,279 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_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-03 02:16:48,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:16:48,482 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:16:48,503 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_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-03 02:16:48,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:16:48,650 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:16:48,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48 WrapperNode [2022-11-03 02:16:48,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:16:48,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:16:48,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:16:48,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:16:48,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,779 INFO L138 Inliner]: procedures = 41, calls = 107, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1581 [2022-11-03 02:16:48,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:16:48,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:16:48,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:16:48,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:16:48,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,836 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:16:48,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:16:48,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:16:48,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:16:48,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (1/1) ... [2022-11-03 02:16:48,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:16:48,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:48,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:16:48,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:16:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-11-03 02:16:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-11-03 02:16:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:16:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-11-03 02:16:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-11-03 02:16:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-03 02:16:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-03 02:16:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-11-03 02:16:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-11-03 02:16:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-03 02:16:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-03 02:16:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 02:16:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 02:16:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-11-03 02:16:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-11-03 02:16:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-11-03 02:16:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-11-03 02:16:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-11-03 02:16:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-11-03 02:16:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 02:16:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 02:16:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:16:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 02:16:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 02:16:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-11-03 02:16:48,961 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-11-03 02:16:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:16:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:16:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-11-03 02:16:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-11-03 02:16:49,287 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:16:49,289 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:16:49,407 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,455 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-11-03 02:16:49,455 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-11-03 02:16:49,507 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,525 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-03 02:16:49,525 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-03 02:16:49,533 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,533 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,537 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,549 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,560 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,563 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:49,566 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:16:50,229 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-11-03 02:16:50,229 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-11-03 02:16:50,230 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-11-03 02:16:50,230 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-11-03 02:16:50,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-11-03 02:16:50,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-11-03 02:16:50,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-11-03 02:16:50,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-11-03 02:16:50,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-11-03 02:16:50,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-03 02:16:50,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-03 02:16:50,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-03 02:16:50,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-03 02:16:50,233 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-11-03 02:16:50,233 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-11-03 02:16:50,300 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:16:50,587 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:16:50,588 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:16:50,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:16:50 BoogieIcfgContainer [2022-11-03 02:16:50,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:16:50,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:16:50,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:16:50,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:16:50,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:16:47" (1/3) ... [2022-11-03 02:16:50,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb7e9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:16:50, skipping insertion in model container [2022-11-03 02:16:50,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:48" (2/3) ... [2022-11-03 02:16:50,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb7e9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:16:50, skipping insertion in model container [2022-11-03 02:16:50,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:16:50" (3/3) ... [2022-11-03 02:16:50,605 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-11-03 02:16:50,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:16:50,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:16:50,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:16:50,717 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dcf0f6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:16:50,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:16:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 265 states have internal predecessors, (375), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-03 02:16:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:16:50,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:50,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:50,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1919223916, now seen corresponding path program 1 times [2022-11-03 02:16:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:50,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455850299] [2022-11-03 02:16:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:50,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:50,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455850299] [2022-11-03 02:16:50,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455850299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:50,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:50,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512463907] [2022-11-03 02:16:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:50,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:50,998 INFO L87 Difference]: Start difference. First operand has 348 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 265 states have internal predecessors, (375), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-11-03 02:16:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:51,488 INFO L93 Difference]: Finished difference Result 665 states and 1074 transitions. [2022-11-03 02:16:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2022-11-03 02:16:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:51,504 INFO L225 Difference]: With dead ends: 665 [2022-11-03 02:16:51,505 INFO L226 Difference]: Without dead ends: 406 [2022-11-03 02:16:51,511 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:51,514 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 358 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:51,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 655 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:16:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-03 02:16:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 402. [2022-11-03 02:16:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 292 states have (on average 1.4486301369863013) internal successors, (423), 302 states have internal predecessors, (423), 91 states have call successors, (91), 21 states have call predecessors, (91), 18 states have return successors, (85), 80 states have call predecessors, (85), 80 states have call successors, (85) [2022-11-03 02:16:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 599 transitions. [2022-11-03 02:16:51,617 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 599 transitions. Word has length 9 [2022-11-03 02:16:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:51,618 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 599 transitions. [2022-11-03 02:16:51,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-11-03 02:16:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 599 transitions. [2022-11-03 02:16:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:16:51,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:51,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:16:51,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 899931247, now seen corresponding path program 1 times [2022-11-03 02:16:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:51,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807895821] [2022-11-03 02:16:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:51,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807895821] [2022-11-03 02:16:51,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807895821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:51,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:51,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90087353] [2022-11-03 02:16:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:51,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:51,817 INFO L87 Difference]: Start difference. First operand 402 states and 599 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-03 02:16:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:52,057 INFO L93 Difference]: Finished difference Result 574 states and 831 transitions. [2022-11-03 02:16:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2022-11-03 02:16:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:52,064 INFO L225 Difference]: With dead ends: 574 [2022-11-03 02:16:52,064 INFO L226 Difference]: Without dead ends: 490 [2022-11-03 02:16:52,069 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:52,071 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 445 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:52,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 552 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-03 02:16:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 462. [2022-11-03 02:16:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 343 states have (on average 1.4285714285714286) internal successors, (490), 348 states have internal predecessors, (490), 92 states have call successors, (92), 26 states have call predecessors, (92), 26 states have return successors, (98), 87 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-03 02:16:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 680 transitions. [2022-11-03 02:16:52,122 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 680 transitions. Word has length 12 [2022-11-03 02:16:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:52,122 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 680 transitions. [2022-11-03 02:16:52,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-03 02:16:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 680 transitions. [2022-11-03 02:16:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:16:52,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:52,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:16:52,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1516168620, now seen corresponding path program 1 times [2022-11-03 02:16:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:52,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392335207] [2022-11-03 02:16:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:52,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:52,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392335207] [2022-11-03 02:16:52,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392335207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:52,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:52,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:16:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536777515] [2022-11-03 02:16:52,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:52,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:52,180 INFO L87 Difference]: Start difference. First operand 462 states and 680 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) [2022-11-03 02:16:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:52,387 INFO L93 Difference]: Finished difference Result 480 states and 703 transitions. [2022-11-03 02:16:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:52,388 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 [2022-11-03 02:16:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:52,394 INFO L225 Difference]: With dead ends: 480 [2022-11-03 02:16:52,394 INFO L226 Difference]: Without dead ends: 462 [2022-11-03 02:16:52,397 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:52,402 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 4 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:52,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 811 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:16:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-03 02:16:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2022-11-03 02:16:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 343 states have (on average 1.4256559766763848) internal successors, (489), 348 states have internal predecessors, (489), 92 states have call successors, (92), 26 states have call predecessors, (92), 26 states have return successors, (98), 87 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-03 02:16:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 679 transitions. [2022-11-03 02:16:52,464 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 679 transitions. Word has length 11 [2022-11-03 02:16:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:52,464 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 679 transitions. [2022-11-03 02:16:52,465 INFO L496 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) [2022-11-03 02:16:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 679 transitions. [2022-11-03 02:16:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:16:52,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:52,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:16:52,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 79915306, now seen corresponding path program 1 times [2022-11-03 02:16:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074813337] [2022-11-03 02:16:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:52,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:52,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074813337] [2022-11-03 02:16:52,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074813337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:52,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:52,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848665674] [2022-11-03 02:16:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:52,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:52,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:52,521 INFO L87 Difference]: Start difference. First operand 462 states and 679 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-03 02:16:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:52,891 INFO L93 Difference]: Finished difference Result 874 states and 1324 transitions. [2022-11-03 02:16:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-03 02:16:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:52,902 INFO L225 Difference]: With dead ends: 874 [2022-11-03 02:16:52,902 INFO L226 Difference]: Without dead ends: 707 [2022-11-03 02:16:52,903 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:52,903 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 228 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:52,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1015 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:16:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-03 02:16:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 589. [2022-11-03 02:16:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 447 states have internal predecessors, (629), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (167), 103 states have call predecessors, (167), 101 states have call successors, (167) [2022-11-03 02:16:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 905 transitions. [2022-11-03 02:16:52,953 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 905 transitions. Word has length 15 [2022-11-03 02:16:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:52,953 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 905 transitions. [2022-11-03 02:16:52,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-03 02:16:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 905 transitions. [2022-11-03 02:16:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:16:52,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:52,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:52,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:16:52,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2056139136, now seen corresponding path program 1 times [2022-11-03 02:16:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264574738] [2022-11-03 02:16:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:52,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:53,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264574738] [2022-11-03 02:16:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264574738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:53,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:53,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030561595] [2022-11-03 02:16:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:53,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:53,073 INFO L87 Difference]: Start difference. First operand 589 states and 905 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-11-03 02:16:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:53,655 INFO L93 Difference]: Finished difference Result 969 states and 1485 transitions. [2022-11-03 02:16:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-11-03 02:16:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:53,660 INFO L225 Difference]: With dead ends: 969 [2022-11-03 02:16:53,661 INFO L226 Difference]: Without dead ends: 585 [2022-11-03 02:16:53,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:16:53,663 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 655 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:53,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 486 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:16:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-11-03 02:16:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 577. [2022-11-03 02:16:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 432 states have (on average 1.4143518518518519) internal successors, (611), 437 states have internal predecessors, (611), 107 states have call successors, (107), 36 states have call predecessors, (107), 37 states have return successors, (163), 103 states have call predecessors, (163), 99 states have call successors, (163) [2022-11-03 02:16:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 881 transitions. [2022-11-03 02:16:53,728 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 881 transitions. Word has length 16 [2022-11-03 02:16:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:53,728 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 881 transitions. [2022-11-03 02:16:53,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-11-03 02:16:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 881 transitions. [2022-11-03 02:16:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:16:53,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:53,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:53,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:16:53,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804921, now seen corresponding path program 1 times [2022-11-03 02:16:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:53,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110088742] [2022-11-03 02:16:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:53,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:53,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:53,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110088742] [2022-11-03 02:16:53,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110088742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:53,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:53,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27300226] [2022-11-03 02:16:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:53,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:53,793 INFO L87 Difference]: Start difference. First operand 577 states and 881 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-11-03 02:16:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:53,986 INFO L93 Difference]: Finished difference Result 580 states and 883 transitions. [2022-11-03 02:16:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-11-03 02:16:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:53,990 INFO L225 Difference]: With dead ends: 580 [2022-11-03 02:16:53,991 INFO L226 Difference]: Without dead ends: 576 [2022-11-03 02:16:53,991 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:53,992 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 7 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:53,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 796 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-03 02:16:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2022-11-03 02:16:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 432 states have (on average 1.4097222222222223) internal successors, (609), 436 states have internal predecessors, (609), 106 states have call successors, (106), 36 states have call predecessors, (106), 37 states have return successors, (163), 103 states have call predecessors, (163), 99 states have call successors, (163) [2022-11-03 02:16:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 878 transitions. [2022-11-03 02:16:54,045 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 878 transitions. Word has length 15 [2022-11-03 02:16:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:54,045 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 878 transitions. [2022-11-03 02:16:54,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-11-03 02:16:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 878 transitions. [2022-11-03 02:16:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:16:54,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:54,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:16:54,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1292848110, now seen corresponding path program 1 times [2022-11-03 02:16:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878033339] [2022-11-03 02:16:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:54,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:54,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878033339] [2022-11-03 02:16:54,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878033339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:54,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:54,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:16:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370568012] [2022-11-03 02:16:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:54,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:54,135 INFO L87 Difference]: Start difference. First operand 576 states and 878 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-03 02:16:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:54,459 INFO L93 Difference]: Finished difference Result 856 states and 1245 transitions. [2022-11-03 02:16:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:16:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 21 [2022-11-03 02:16:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:54,463 INFO L225 Difference]: With dead ends: 856 [2022-11-03 02:16:54,463 INFO L226 Difference]: Without dead ends: 569 [2022-11-03 02:16:54,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:16:54,465 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 217 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:54,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1236 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:16:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-03 02:16:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 480. [2022-11-03 02:16:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 357 states have (on average 1.3865546218487395) internal successors, (495), 363 states have internal predecessors, (495), 91 states have call successors, (91), 32 states have call predecessors, (91), 31 states have return successors, (103), 84 states have call predecessors, (103), 84 states have call successors, (103) [2022-11-03 02:16:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 689 transitions. [2022-11-03 02:16:54,515 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 689 transitions. Word has length 21 [2022-11-03 02:16:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:54,516 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 689 transitions. [2022-11-03 02:16:54,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-03 02:16:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 689 transitions. [2022-11-03 02:16:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:16:54,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:54,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:54,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:16:54,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -348392507, now seen corresponding path program 1 times [2022-11-03 02:16:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:54,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103534397] [2022-11-03 02:16:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:54,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:54,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103534397] [2022-11-03 02:16:54,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103534397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:54,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:54,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594335223] [2022-11-03 02:16:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:54,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:54,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:54,602 INFO L87 Difference]: Start difference. First operand 480 states and 689 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:54,760 INFO L93 Difference]: Finished difference Result 535 states and 757 transitions. [2022-11-03 02:16:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:54,760 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:16:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:54,763 INFO L225 Difference]: With dead ends: 535 [2022-11-03 02:16:54,763 INFO L226 Difference]: Without dead ends: 517 [2022-11-03 02:16:54,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:54,764 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 460 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:54,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 452 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-11-03 02:16:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 502. [2022-11-03 02:16:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 376 states have (on average 1.375) internal successors, (517), 381 states have internal predecessors, (517), 91 states have call successors, (91), 33 states have call predecessors, (91), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 02:16:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 714 transitions. [2022-11-03 02:16:54,818 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 714 transitions. Word has length 22 [2022-11-03 02:16:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:54,818 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 714 transitions. [2022-11-03 02:16:54,818 INFO L496 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:16:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 714 transitions. [2022-11-03 02:16:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:16:54,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:54,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:16:54,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1814122477, now seen corresponding path program 1 times [2022-11-03 02:16:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:54,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466159564] [2022-11-03 02:16:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:54,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:54,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466159564] [2022-11-03 02:16:54,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466159564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:54,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:54,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595100169] [2022-11-03 02:16:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:54,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:54,901 INFO L87 Difference]: Start difference. First operand 502 states and 714 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-11-03 02:16:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:55,414 INFO L93 Difference]: Finished difference Result 554 states and 780 transitions. [2022-11-03 02:16:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2022-11-03 02:16:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:55,417 INFO L225 Difference]: With dead ends: 554 [2022-11-03 02:16:55,417 INFO L226 Difference]: Without dead ends: 518 [2022-11-03 02:16:55,418 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:55,418 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 500 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:55,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 650 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:16:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-03 02:16:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 502. [2022-11-03 02:16:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 376 states have (on average 1.3696808510638299) internal successors, (515), 381 states have internal predecessors, (515), 91 states have call successors, (91), 33 states have call predecessors, (91), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 02:16:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 712 transitions. [2022-11-03 02:16:55,472 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 712 transitions. Word has length 22 [2022-11-03 02:16:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:55,472 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 712 transitions. [2022-11-03 02:16:55,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-11-03 02:16:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 712 transitions. [2022-11-03 02:16:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:16:55,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:55,474 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:55,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:16:55,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1032472310, now seen corresponding path program 1 times [2022-11-03 02:16:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:55,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174817223] [2022-11-03 02:16:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:55,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174817223] [2022-11-03 02:16:55,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174817223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:55,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:55,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961509106] [2022-11-03 02:16:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:55,550 INFO L87 Difference]: Start difference. First operand 502 states and 712 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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) [2022-11-03 02:16:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:56,053 INFO L93 Difference]: Finished difference Result 538 states and 758 transitions. [2022-11-03 02:16:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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 [2022-11-03 02:16:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:56,057 INFO L225 Difference]: With dead ends: 538 [2022-11-03 02:16:56,058 INFO L226 Difference]: Without dead ends: 502 [2022-11-03 02:16:56,058 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:56,059 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 486 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:56,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 648 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:16:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-11-03 02:16:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2022-11-03 02:16:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 376 states have (on average 1.3643617021276595) internal successors, (513), 381 states have internal predecessors, (513), 91 states have call successors, (91), 33 states have call predecessors, (91), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 02:16:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 710 transitions. [2022-11-03 02:16:56,117 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 710 transitions. Word has length 23 [2022-11-03 02:16:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:56,117 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 710 transitions. [2022-11-03 02:16:56,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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) [2022-11-03 02:16:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 710 transitions. [2022-11-03 02:16:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:16:56,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:56,119 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:56,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:16:56,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 202533160, now seen corresponding path program 1 times [2022-11-03 02:16:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:56,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955230482] [2022-11-03 02:16:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:56,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:56,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955230482] [2022-11-03 02:16:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955230482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:56,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:56,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199047434] [2022-11-03 02:16:56,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:56,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:56,158 INFO L87 Difference]: Start difference. First operand 502 states and 710 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) 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) [2022-11-03 02:16:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:56,397 INFO L93 Difference]: Finished difference Result 616 states and 865 transitions. [2022-11-03 02:16:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) 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 [2022-11-03 02:16:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:56,402 INFO L225 Difference]: With dead ends: 616 [2022-11-03 02:16:56,402 INFO L226 Difference]: Without dead ends: 605 [2022-11-03 02:16:56,403 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:56,404 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 98 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:56,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 843 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:16:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-03 02:16:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 525. [2022-11-03 02:16:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 397 states have (on average 1.350125944584383) internal successors, (536), 402 states have internal predecessors, (536), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:16:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 734 transitions. [2022-11-03 02:16:56,471 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 734 transitions. Word has length 24 [2022-11-03 02:16:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:56,472 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 734 transitions. [2022-11-03 02:16:56,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) 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) [2022-11-03 02:16:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 734 transitions. [2022-11-03 02:16:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:16:56,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:56,477 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:16:56,477 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1508775286, now seen corresponding path program 1 times [2022-11-03 02:16:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:56,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41467858] [2022-11-03 02:16:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:56,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:56,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41467858] [2022-11-03 02:16:56,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41467858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:56,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:56,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:56,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843337954] [2022-11-03 02:16:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:56,523 INFO L87 Difference]: Start difference. First operand 525 states and 734 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:16:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:56,712 INFO L93 Difference]: Finished difference Result 726 states and 1004 transitions. [2022-11-03 02:16:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 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 [2022-11-03 02:16:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:56,715 INFO L225 Difference]: With dead ends: 726 [2022-11-03 02:16:56,715 INFO L226 Difference]: Without dead ends: 571 [2022-11-03 02:16:56,719 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:56,719 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 115 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:56,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 830 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-03 02:16:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 525. [2022-11-03 02:16:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 397 states have (on average 1.345088161209068) internal successors, (534), 402 states have internal predecessors, (534), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:16:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 732 transitions. [2022-11-03 02:16:56,787 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 732 transitions. Word has length 28 [2022-11-03 02:16:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:56,787 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 732 transitions. [2022-11-03 02:16:56,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:16:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 732 transitions. [2022-11-03 02:16:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:16:56,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:56,790 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:56,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:16:56,790 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1866900694, now seen corresponding path program 1 times [2022-11-03 02:16:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:56,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646122328] [2022-11-03 02:16:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:56,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:56,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646122328] [2022-11-03 02:16:56,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646122328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:56,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:56,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998817023] [2022-11-03 02:16:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:56,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:56,891 INFO L87 Difference]: Start difference. First operand 525 states and 732 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) [2022-11-03 02:16:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:57,587 INFO L93 Difference]: Finished difference Result 601 states and 844 transitions. [2022-11-03 02:16:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:57,587 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 [2022-11-03 02:16:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:57,591 INFO L225 Difference]: With dead ends: 601 [2022-11-03 02:16:57,591 INFO L226 Difference]: Without dead ends: 597 [2022-11-03 02:16:57,592 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:57,592 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 541 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:57,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 700 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:16:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-03 02:16:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 527. [2022-11-03 02:16:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 404 states have internal predecessors, (536), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:16:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 734 transitions. [2022-11-03 02:16:57,667 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 734 transitions. Word has length 25 [2022-11-03 02:16:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:57,667 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 734 transitions. [2022-11-03 02:16:57,667 INFO L496 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) [2022-11-03 02:16:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 734 transitions. [2022-11-03 02:16:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:16:57,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:57,670 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:57,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:16:57,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1866623864, now seen corresponding path program 1 times [2022-11-03 02:16:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:57,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195747545] [2022-11-03 02:16:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:57,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195747545] [2022-11-03 02:16:57,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195747545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:57,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:57,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:16:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041647757] [2022-11-03 02:16:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:16:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:16:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:16:57,766 INFO L87 Difference]: Start difference. First operand 527 states and 734 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-11-03 02:16:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:58,043 INFO L93 Difference]: Finished difference Result 539 states and 745 transitions. [2022-11-03 02:16:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:58,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 [2022-11-03 02:16:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:58,048 INFO L225 Difference]: With dead ends: 539 [2022-11-03 02:16:58,048 INFO L226 Difference]: Without dead ends: 518 [2022-11-03 02:16:58,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:16:58,049 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 9 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:58,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1240 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:16:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-03 02:16:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2022-11-03 02:16:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 390 states have (on average 1.3487179487179488) internal successors, (526), 395 states have internal predecessors, (526), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:16:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 724 transitions. [2022-11-03 02:16:58,127 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 724 transitions. Word has length 25 [2022-11-03 02:16:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:58,127 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 724 transitions. [2022-11-03 02:16:58,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) [2022-11-03 02:16:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 724 transitions. [2022-11-03 02:16:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:16:58,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:58,130 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:58,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:16:58,130 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash -69742661, now seen corresponding path program 1 times [2022-11-03 02:16:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:58,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189735030] [2022-11-03 02:16:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:58,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:58,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189735030] [2022-11-03 02:16:58,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189735030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:58,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:58,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898934523] [2022-11-03 02:16:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:58,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:58,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:58,184 INFO L87 Difference]: Start difference. First operand 518 states and 724 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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) [2022-11-03 02:16:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:58,383 INFO L93 Difference]: Finished difference Result 538 states and 746 transitions. [2022-11-03 02:16:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:58,384 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), 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 [2022-11-03 02:16:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:58,387 INFO L225 Difference]: With dead ends: 538 [2022-11-03 02:16:58,387 INFO L226 Difference]: Without dead ends: 531 [2022-11-03 02:16:58,389 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:58,391 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 57 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:58,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 738 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-03 02:16:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2022-11-03 02:16:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 401 states have (on average 1.341645885286783) internal successors, (538), 406 states have internal predecessors, (538), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:16:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 736 transitions. [2022-11-03 02:16:58,456 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 736 transitions. Word has length 27 [2022-11-03 02:16:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:58,456 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 736 transitions. [2022-11-03 02:16:58,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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) [2022-11-03 02:16:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 736 transitions. [2022-11-03 02:16:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:16:58,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:58,458 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:58,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:16:58,459 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash -727433793, now seen corresponding path program 1 times [2022-11-03 02:16:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100104010] [2022-11-03 02:16:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:58,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100104010] [2022-11-03 02:16:58,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100104010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:58,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:58,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:16:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939445147] [2022-11-03 02:16:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:16:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:58,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:16:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:16:58,502 INFO L87 Difference]: Start difference. First operand 529 states and 736 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:16:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:58,675 INFO L93 Difference]: Finished difference Result 594 states and 808 transitions. [2022-11-03 02:16:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:16:58,676 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 02:16:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:58,679 INFO L225 Difference]: With dead ends: 594 [2022-11-03 02:16:58,679 INFO L226 Difference]: Without dead ends: 535 [2022-11-03 02:16:58,680 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:58,681 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 406 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:58,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 510 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:16:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-03 02:16:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 520. [2022-11-03 02:16:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 396 states have (on average 1.3409090909090908) internal successors, (531), 401 states have internal predecessors, (531), 89 states have call successors, (89), 31 states have call predecessors, (89), 34 states have return successors, (105), 87 states have call predecessors, (105), 83 states have call successors, (105) [2022-11-03 02:16:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 725 transitions. [2022-11-03 02:16:58,745 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 725 transitions. Word has length 29 [2022-11-03 02:16:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:58,745 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 725 transitions. [2022-11-03 02:16:58,746 INFO L496 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:16:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 725 transitions. [2022-11-03 02:16:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:16:58,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:58,748 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:58,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:16:58,748 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1960458144, now seen corresponding path program 1 times [2022-11-03 02:16:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458694634] [2022-11-03 02:16:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:58,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:58,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458694634] [2022-11-03 02:16:58,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458694634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:58,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:58,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:16:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839114629] [2022-11-03 02:16:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:58,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:16:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:16:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:16:58,834 INFO L87 Difference]: Start difference. First operand 520 states and 725 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-11-03 02:16:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:59,365 INFO L93 Difference]: Finished difference Result 528 states and 731 transitions. [2022-11-03 02:16:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:16:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 29 [2022-11-03 02:16:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:59,368 INFO L225 Difference]: With dead ends: 528 [2022-11-03 02:16:59,369 INFO L226 Difference]: Without dead ends: 522 [2022-11-03 02:16:59,369 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:16:59,370 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 526 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:59,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 831 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:16:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-03 02:16:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2022-11-03 02:16:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 396 states have (on average 1.3383838383838385) internal successors, (530), 401 states have internal predecessors, (530), 89 states have call successors, (89), 31 states have call predecessors, (89), 34 states have return successors, (105), 87 states have call predecessors, (105), 83 states have call successors, (105) [2022-11-03 02:16:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 724 transitions. [2022-11-03 02:16:59,457 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 724 transitions. Word has length 29 [2022-11-03 02:16:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:59,457 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 724 transitions. [2022-11-03 02:16:59,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-11-03 02:16:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 724 transitions. [2022-11-03 02:16:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:16:59,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:59,460 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:59,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:16:59,460 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash 957724096, now seen corresponding path program 1 times [2022-11-03 02:16:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:59,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989973065] [2022-11-03 02:16:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:59,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:59,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989973065] [2022-11-03 02:16:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989973065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:16:59,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:16:59,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:16:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72480816] [2022-11-03 02:16:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:16:59,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:16:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:59,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:16:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:16:59,548 INFO L87 Difference]: Start difference. First operand 520 states and 724 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-11-03 02:16:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:59,918 INFO L93 Difference]: Finished difference Result 539 states and 743 transitions. [2022-11-03 02:16:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:16:59,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2022-11-03 02:16:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:59,921 INFO L225 Difference]: With dead ends: 539 [2022-11-03 02:16:59,921 INFO L226 Difference]: Without dead ends: 515 [2022-11-03 02:16:59,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:16:59,923 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 38 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:59,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1987 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:16:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-03 02:16:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-11-03 02:16:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 393 states have (on average 1.3155216284987277) internal successors, (517), 398 states have internal predecessors, (517), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (103), 85 states have call predecessors, (103), 81 states have call successors, (103) [2022-11-03 02:16:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 707 transitions. [2022-11-03 02:16:59,987 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 707 transitions. Word has length 30 [2022-11-03 02:16:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:59,988 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 707 transitions. [2022-11-03 02:16:59,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-11-03 02:16:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 707 transitions. [2022-11-03 02:16:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:16:59,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:59,990 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:16:59,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:16:59,991 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1508878238, now seen corresponding path program 1 times [2022-11-03 02:16:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:59,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434397621] [2022-11-03 02:16:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:00,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:00,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434397621] [2022-11-03 02:17:00,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434397621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:00,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:00,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850359555] [2022-11-03 02:17:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:00,031 INFO L87 Difference]: Start difference. First operand 515 states and 707 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:00,250 INFO L93 Difference]: Finished difference Result 666 states and 912 transitions. [2022-11-03 02:17:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-03 02:17:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:00,254 INFO L225 Difference]: With dead ends: 666 [2022-11-03 02:17:00,254 INFO L226 Difference]: Without dead ends: 498 [2022-11-03 02:17:00,255 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:00,255 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:00,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-03 02:17:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2022-11-03 02:17:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 379 states have (on average 1.3060686015831136) internal successors, (495), 383 states have internal predecessors, (495), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (101), 83 states have call predecessors, (101), 81 states have call successors, (101) [2022-11-03 02:17:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 682 transitions. [2022-11-03 02:17:00,336 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 682 transitions. Word has length 36 [2022-11-03 02:17:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:00,337 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 682 transitions. [2022-11-03 02:17:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 682 transitions. [2022-11-03 02:17:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:17:00,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:00,339 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:00,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:17:00,340 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1857138847, now seen corresponding path program 1 times [2022-11-03 02:17:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:00,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571553075] [2022-11-03 02:17:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:00,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571553075] [2022-11-03 02:17:00,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571553075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:00,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:00,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:17:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725348180] [2022-11-03 02:17:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:17:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:17:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:17:00,383 INFO L87 Difference]: Start difference. First operand 498 states and 682 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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) [2022-11-03 02:17:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:00,761 INFO L93 Difference]: Finished difference Result 544 states and 730 transitions. [2022-11-03 02:17:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:17:00,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 [2022-11-03 02:17:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:00,764 INFO L225 Difference]: With dead ends: 544 [2022-11-03 02:17:00,765 INFO L226 Difference]: Without dead ends: 516 [2022-11-03 02:17:00,765 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:00,766 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 487 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:00,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 711 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-11-03 02:17:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 498. [2022-11-03 02:17:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 379 states have (on average 1.3034300791556728) internal successors, (494), 383 states have internal predecessors, (494), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (101), 83 states have call predecessors, (101), 81 states have call successors, (101) [2022-11-03 02:17:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 681 transitions. [2022-11-03 02:17:00,828 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 681 transitions. Word has length 32 [2022-11-03 02:17:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:00,828 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 681 transitions. [2022-11-03 02:17:00,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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) [2022-11-03 02:17:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 681 transitions. [2022-11-03 02:17:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:17:00,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:00,831 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:00,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:17:00,832 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -817925663, now seen corresponding path program 1 times [2022-11-03 02:17:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:00,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974541698] [2022-11-03 02:17:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:01,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:01,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974541698] [2022-11-03 02:17:01,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974541698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:01,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:01,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697474178] [2022-11-03 02:17:01,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:01,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:01,013 INFO L87 Difference]: Start difference. First operand 498 states and 681 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:01,523 INFO L93 Difference]: Finished difference Result 530 states and 713 transitions. [2022-11-03 02:17:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-03 02:17:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:01,526 INFO L225 Difference]: With dead ends: 530 [2022-11-03 02:17:01,527 INFO L226 Difference]: Without dead ends: 512 [2022-11-03 02:17:01,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:01,528 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 41 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:01,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3028 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-03 02:17:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 496. [2022-11-03 02:17:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 378 states have (on average 1.3015873015873016) internal successors, (492), 382 states have internal predecessors, (492), 85 states have call successors, (85), 31 states have call predecessors, (85), 32 states have return successors, (100), 82 states have call predecessors, (100), 80 states have call successors, (100) [2022-11-03 02:17:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 677 transitions. [2022-11-03 02:17:01,589 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 677 transitions. Word has length 35 [2022-11-03 02:17:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:01,590 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 677 transitions. [2022-11-03 02:17:01,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 677 transitions. [2022-11-03 02:17:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:17:01,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:01,593 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:01,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:17:01,593 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1453091592, now seen corresponding path program 1 times [2022-11-03 02:17:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:01,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095987856] [2022-11-03 02:17:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:01,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095987856] [2022-11-03 02:17:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095987856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:01,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:01,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86103918] [2022-11-03 02:17:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:01,765 INFO L87 Difference]: Start difference. First operand 496 states and 677 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:02,283 INFO L93 Difference]: Finished difference Result 528 states and 709 transitions. [2022-11-03 02:17:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-03 02:17:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:02,286 INFO L225 Difference]: With dead ends: 528 [2022-11-03 02:17:02,287 INFO L226 Difference]: Without dead ends: 509 [2022-11-03 02:17:02,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:02,288 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 50 mSDsluCounter, 3034 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:02,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3023 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-11-03 02:17:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 495. [2022-11-03 02:17:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 377 states have (on average 1.2758620689655173) internal successors, (481), 381 states have internal predecessors, (481), 85 states have call successors, (85), 31 states have call predecessors, (85), 32 states have return successors, (100), 82 states have call predecessors, (100), 80 states have call successors, (100) [2022-11-03 02:17:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 666 transitions. [2022-11-03 02:17:02,349 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 666 transitions. Word has length 33 [2022-11-03 02:17:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:02,349 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 666 transitions. [2022-11-03 02:17:02,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 666 transitions. [2022-11-03 02:17:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:17:02,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:02,352 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:17:02,353 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1691601971, now seen corresponding path program 1 times [2022-11-03 02:17:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807205506] [2022-11-03 02:17:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:02,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:02,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807205506] [2022-11-03 02:17:02,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807205506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:02,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:02,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146588796] [2022-11-03 02:17:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:02,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:02,439 INFO L87 Difference]: Start difference. First operand 495 states and 666 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-11-03 02:17:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:02,730 INFO L93 Difference]: Finished difference Result 511 states and 681 transitions. [2022-11-03 02:17:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 33 [2022-11-03 02:17:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:02,734 INFO L225 Difference]: With dead ends: 511 [2022-11-03 02:17:02,734 INFO L226 Difference]: Without dead ends: 489 [2022-11-03 02:17:02,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:02,735 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 38 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1843 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-03 02:17:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2022-11-03 02:17:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 374 states have (on average 1.2700534759358288) internal successors, (475), 378 states have internal predecessors, (475), 82 states have call successors, (82), 31 states have call predecessors, (82), 32 states have return successors, (97), 79 states have call predecessors, (97), 77 states have call successors, (97) [2022-11-03 02:17:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2022-11-03 02:17:02,795 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 33 [2022-11-03 02:17:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:02,795 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2022-11-03 02:17:02,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-11-03 02:17:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2022-11-03 02:17:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:17:02,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:02,798 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:17:02,798 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -224029772, now seen corresponding path program 1 times [2022-11-03 02:17:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:02,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703196913] [2022-11-03 02:17:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:02,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:02,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703196913] [2022-11-03 02:17:02,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703196913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:02,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:02,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057922059] [2022-11-03 02:17:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:02,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:02,934 INFO L87 Difference]: Start difference. First operand 489 states and 654 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:03,334 INFO L93 Difference]: Finished difference Result 502 states and 666 transitions. [2022-11-03 02:17:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-03 02:17:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:03,337 INFO L225 Difference]: With dead ends: 502 [2022-11-03 02:17:03,337 INFO L226 Difference]: Without dead ends: 487 [2022-11-03 02:17:03,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:03,339 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 10 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:03,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2873 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-03 02:17:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2022-11-03 02:17:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 373 states have (on average 1.2680965147453083) internal successors, (473), 377 states have internal predecessors, (473), 81 states have call successors, (81), 31 states have call predecessors, (81), 32 states have return successors, (96), 78 states have call predecessors, (96), 76 states have call successors, (96) [2022-11-03 02:17:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 650 transitions. [2022-11-03 02:17:03,394 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 650 transitions. Word has length 35 [2022-11-03 02:17:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:03,395 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 650 transitions. [2022-11-03 02:17:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 650 transitions. [2022-11-03 02:17:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:17:03,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:03,397 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:03,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:17:03,397 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -587249049, now seen corresponding path program 1 times [2022-11-03 02:17:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884238733] [2022-11-03 02:17:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:03,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884238733] [2022-11-03 02:17:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884238733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:03,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:03,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160675738] [2022-11-03 02:17:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:03,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:03,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:03,477 INFO L87 Difference]: Start difference. First operand 487 states and 650 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2022-11-03 02:17:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:03,775 INFO L93 Difference]: Finished difference Result 507 states and 670 transitions. [2022-11-03 02:17:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 34 [2022-11-03 02:17:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:03,781 INFO L225 Difference]: With dead ends: 507 [2022-11-03 02:17:03,781 INFO L226 Difference]: Without dead ends: 483 [2022-11-03 02:17:03,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:03,782 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 40 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:03,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1786 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-11-03 02:17:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2022-11-03 02:17:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 371 states have (on average 1.2587601078167117) internal successors, (467), 375 states have internal predecessors, (467), 79 states have call successors, (79), 31 states have call predecessors, (79), 32 states have return successors, (94), 76 states have call predecessors, (94), 74 states have call successors, (94) [2022-11-03 02:17:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 640 transitions. [2022-11-03 02:17:03,880 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 640 transitions. Word has length 34 [2022-11-03 02:17:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:03,880 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 640 transitions. [2022-11-03 02:17:03,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) [2022-11-03 02:17:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 640 transitions. [2022-11-03 02:17:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:03,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:03,883 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:03,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:17:03,884 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1567425594, now seen corresponding path program 1 times [2022-11-03 02:17:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:03,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386116425] [2022-11-03 02:17:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:04,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:04,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386116425] [2022-11-03 02:17:04,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386116425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:04,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:04,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207659078] [2022-11-03 02:17:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:04,026 INFO L87 Difference]: Start difference. First operand 483 states and 640 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:04,428 INFO L93 Difference]: Finished difference Result 496 states and 652 transitions. [2022-11-03 02:17:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 02:17:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:04,435 INFO L225 Difference]: With dead ends: 496 [2022-11-03 02:17:04,436 INFO L226 Difference]: Without dead ends: 481 [2022-11-03 02:17:04,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:04,437 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 10 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:04,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2766 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-03 02:17:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2022-11-03 02:17:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 370 states have (on average 1.2567567567567568) internal successors, (465), 374 states have internal predecessors, (465), 78 states have call successors, (78), 31 states have call predecessors, (78), 32 states have return successors, (93), 75 states have call predecessors, (93), 73 states have call successors, (93) [2022-11-03 02:17:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 636 transitions. [2022-11-03 02:17:04,503 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 636 transitions. Word has length 36 [2022-11-03 02:17:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:04,503 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 636 transitions. [2022-11-03 02:17:04,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 636 transitions. [2022-11-03 02:17:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:04,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:04,506 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 02:17:04,506 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1961531049, now seen corresponding path program 1 times [2022-11-03 02:17:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:04,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727999610] [2022-11-03 02:17:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:04,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:04,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727999610] [2022-11-03 02:17:04,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727999610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:04,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:04,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652564867] [2022-11-03 02:17:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:04,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:04,616 INFO L87 Difference]: Start difference. First operand 481 states and 636 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:04,968 INFO L93 Difference]: Finished difference Result 493 states and 647 transitions. [2022-11-03 02:17:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 02:17:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:04,971 INFO L225 Difference]: With dead ends: 493 [2022-11-03 02:17:04,972 INFO L226 Difference]: Without dead ends: 478 [2022-11-03 02:17:04,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:04,973 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 10 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:04,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2744 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-11-03 02:17:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-11-03 02:17:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 368 states have (on average 1.2554347826086956) internal successors, (462), 372 states have internal predecessors, (462), 77 states have call successors, (77), 31 states have call predecessors, (77), 32 states have return successors, (92), 74 states have call predecessors, (92), 72 states have call successors, (92) [2022-11-03 02:17:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 631 transitions. [2022-11-03 02:17:05,041 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 631 transitions. Word has length 36 [2022-11-03 02:17:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:05,041 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 631 transitions. [2022-11-03 02:17:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 631 transitions. [2022-11-03 02:17:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:05,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:05,044 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:05,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 02:17:05,044 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1429899542, now seen corresponding path program 1 times [2022-11-03 02:17:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:05,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087567304] [2022-11-03 02:17:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:05,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:05,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087567304] [2022-11-03 02:17:05,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087567304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:05,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:05,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837815804] [2022-11-03 02:17:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:05,124 INFO L87 Difference]: Start difference. First operand 478 states and 631 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:05,382 INFO L93 Difference]: Finished difference Result 494 states and 646 transitions. [2022-11-03 02:17:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 02:17:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:05,385 INFO L225 Difference]: With dead ends: 494 [2022-11-03 02:17:05,385 INFO L226 Difference]: Without dead ends: 476 [2022-11-03 02:17:05,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:05,387 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 36 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:05,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1737 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-03 02:17:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-03 02:17:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 367 states have (on average 1.2534059945504088) internal successors, (460), 371 states have internal predecessors, (460), 76 states have call successors, (76), 31 states have call predecessors, (76), 32 states have return successors, (91), 73 states have call predecessors, (91), 71 states have call successors, (91) [2022-11-03 02:17:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 627 transitions. [2022-11-03 02:17:05,441 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 627 transitions. Word has length 36 [2022-11-03 02:17:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:05,442 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 627 transitions. [2022-11-03 02:17:05,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 627 transitions. [2022-11-03 02:17:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:05,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:05,444 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:05,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 02:17:05,444 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1191025868, now seen corresponding path program 1 times [2022-11-03 02:17:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:05,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110940541] [2022-11-03 02:17:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:05,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110940541] [2022-11-03 02:17:05,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110940541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:05,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:05,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442243522] [2022-11-03 02:17:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:05,518 INFO L87 Difference]: Start difference. First operand 476 states and 627 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:05,736 INFO L93 Difference]: Finished difference Result 510 states and 675 transitions. [2022-11-03 02:17:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 02:17:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:05,739 INFO L225 Difference]: With dead ends: 510 [2022-11-03 02:17:05,739 INFO L226 Difference]: Without dead ends: 486 [2022-11-03 02:17:05,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:05,741 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 0 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:05,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1360 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-03 02:17:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2022-11-03 02:17:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 371 states have (on average 1.2506738544474394) internal successors, (464), 379 states have internal predecessors, (464), 76 states have call successors, (76), 31 states have call predecessors, (76), 36 states have return successors, (109), 73 states have call predecessors, (109), 71 states have call successors, (109) [2022-11-03 02:17:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 649 transitions. [2022-11-03 02:17:05,813 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 649 transitions. Word has length 36 [2022-11-03 02:17:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:05,813 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 649 transitions. [2022-11-03 02:17:05,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 649 transitions. [2022-11-03 02:17:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:05,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:05,825 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:05,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 02:17:05,825 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 687810898, now seen corresponding path program 1 times [2022-11-03 02:17:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390638577] [2022-11-03 02:17:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:05,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:05,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390638577] [2022-11-03 02:17:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390638577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:05,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:05,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853814782] [2022-11-03 02:17:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:05,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:05,955 INFO L87 Difference]: Start difference. First operand 484 states and 649 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:06,374 INFO L93 Difference]: Finished difference Result 500 states and 664 transitions. [2022-11-03 02:17:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 02:17:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:06,377 INFO L225 Difference]: With dead ends: 500 [2022-11-03 02:17:06,377 INFO L226 Difference]: Without dead ends: 482 [2022-11-03 02:17:06,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:06,378 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 36 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:06,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2652 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-03 02:17:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-11-03 02:17:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 370 states have (on average 1.2486486486486486) internal successors, (462), 378 states have internal predecessors, (462), 75 states have call successors, (75), 31 states have call predecessors, (75), 36 states have return successors, (108), 72 states have call predecessors, (108), 70 states have call successors, (108) [2022-11-03 02:17:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 645 transitions. [2022-11-03 02:17:06,432 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 645 transitions. Word has length 36 [2022-11-03 02:17:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:06,432 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 645 transitions. [2022-11-03 02:17:06,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 645 transitions. [2022-11-03 02:17:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 02:17:06,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:06,435 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:06,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 02:17:06,435 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2066063429, now seen corresponding path program 1 times [2022-11-03 02:17:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:06,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054843493] [2022-11-03 02:17:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:06,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:06,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054843493] [2022-11-03 02:17:06,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054843493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:06,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:06,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120154755] [2022-11-03 02:17:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:06,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:06,511 INFO L87 Difference]: Start difference. First operand 482 states and 645 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:06,997 INFO L93 Difference]: Finished difference Result 747 states and 993 transitions. [2022-11-03 02:17:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:17:06,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2022-11-03 02:17:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:07,000 INFO L225 Difference]: With dead ends: 747 [2022-11-03 02:17:07,001 INFO L226 Difference]: Without dead ends: 475 [2022-11-03 02:17:07,002 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:07,002 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 394 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:07,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 642 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-03 02:17:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-03 02:17:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 365 states have (on average 1.2356164383561643) internal successors, (451), 372 states have internal predecessors, (451), 74 states have call successors, (74), 31 states have call predecessors, (74), 35 states have return successors, (98), 71 states have call predecessors, (98), 69 states have call successors, (98) [2022-11-03 02:17:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 623 transitions. [2022-11-03 02:17:07,072 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 623 transitions. Word has length 51 [2022-11-03 02:17:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:07,072 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 623 transitions. [2022-11-03 02:17:07,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 623 transitions. [2022-11-03 02:17:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:17:07,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:07,074 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:07,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 02:17:07,075 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:07,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -652931360, now seen corresponding path program 1 times [2022-11-03 02:17:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115169255] [2022-11-03 02:17:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:07,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:07,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115169255] [2022-11-03 02:17:07,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115169255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:07,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:07,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792274904] [2022-11-03 02:17:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:07,134 INFO L87 Difference]: Start difference. First operand 475 states and 623 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:07,289 INFO L93 Difference]: Finished difference Result 555 states and 714 transitions. [2022-11-03 02:17:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-03 02:17:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:07,292 INFO L225 Difference]: With dead ends: 555 [2022-11-03 02:17:07,292 INFO L226 Difference]: Without dead ends: 492 [2022-11-03 02:17:07,293 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:07,293 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 76 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:07,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 702 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-03 02:17:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 476. [2022-11-03 02:17:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 366 states have (on average 1.2295081967213115) internal successors, (450), 372 states have internal predecessors, (450), 73 states have call successors, (73), 32 states have call predecessors, (73), 36 states have return successors, (98), 71 states have call predecessors, (98), 69 states have call successors, (98) [2022-11-03 02:17:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 621 transitions. [2022-11-03 02:17:07,351 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 621 transitions. Word has length 40 [2022-11-03 02:17:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:07,352 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 621 transitions. [2022-11-03 02:17:07,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 621 transitions. [2022-11-03 02:17:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:17:07,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:07,354 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:07,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 02:17:07,354 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -331348938, now seen corresponding path program 1 times [2022-11-03 02:17:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049081182] [2022-11-03 02:17:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:07,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049081182] [2022-11-03 02:17:07,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049081182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:07,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801180813] [2022-11-03 02:17:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:07,421 INFO L87 Difference]: Start difference. First operand 476 states and 621 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:07,688 INFO L93 Difference]: Finished difference Result 550 states and 701 transitions. [2022-11-03 02:17:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-03 02:17:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:07,691 INFO L225 Difference]: With dead ends: 550 [2022-11-03 02:17:07,691 INFO L226 Difference]: Without dead ends: 528 [2022-11-03 02:17:07,692 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:07,692 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 115 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:07,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1324 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-03 02:17:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 480. [2022-11-03 02:17:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 369 states have (on average 1.2276422764227641) internal successors, (453), 375 states have internal predecessors, (453), 74 states have call successors, (74), 32 states have call predecessors, (74), 36 states have return successors, (100), 72 states have call predecessors, (100), 70 states have call successors, (100) [2022-11-03 02:17:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 627 transitions. [2022-11-03 02:17:07,752 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 627 transitions. Word has length 37 [2022-11-03 02:17:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:07,752 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 627 transitions. [2022-11-03 02:17:07,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 627 transitions. [2022-11-03 02:17:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 02:17:07,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:07,755 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:07,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 02:17:07,755 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2105403400, now seen corresponding path program 1 times [2022-11-03 02:17:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858103301] [2022-11-03 02:17:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:07,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858103301] [2022-11-03 02:17:07,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858103301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:07,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:07,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806800891] [2022-11-03 02:17:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:07,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:07,977 INFO L87 Difference]: Start difference. First operand 480 states and 627 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:08,424 INFO L93 Difference]: Finished difference Result 493 states and 639 transitions. [2022-11-03 02:17:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:17:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-03 02:17:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:08,427 INFO L225 Difference]: With dead ends: 493 [2022-11-03 02:17:08,427 INFO L226 Difference]: Without dead ends: 471 [2022-11-03 02:17:08,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:08,428 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 20 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:08,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2966 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-03 02:17:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2022-11-03 02:17:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 362 states have (on average 1.2265193370165746) internal successors, (444), 368 states have internal predecessors, (444), 72 states have call successors, (72), 32 states have call predecessors, (72), 36 states have return successors, (98), 70 states have call predecessors, (98), 68 states have call successors, (98) [2022-11-03 02:17:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 614 transitions. [2022-11-03 02:17:08,487 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 614 transitions. Word has length 44 [2022-11-03 02:17:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 614 transitions. [2022-11-03 02:17:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 614 transitions. [2022-11-03 02:17:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:17:08,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:08,490 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 02:17:08,491 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1861497653, now seen corresponding path program 1 times [2022-11-03 02:17:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955891838] [2022-11-03 02:17:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:08,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955891838] [2022-11-03 02:17:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955891838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:08,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:08,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537151856] [2022-11-03 02:17:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:08,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:08,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:08,629 INFO L87 Difference]: Start difference. First operand 471 states and 614 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:09,075 INFO L93 Difference]: Finished difference Result 484 states and 626 transitions. [2022-11-03 02:17:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:17:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-11-03 02:17:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:09,078 INFO L225 Difference]: With dead ends: 484 [2022-11-03 02:17:09,079 INFO L226 Difference]: Without dead ends: 468 [2022-11-03 02:17:09,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:09,080 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 20 mSDsluCounter, 2901 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:09,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2845 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-03 02:17:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-11-03 02:17:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.225) internal successors, (441), 366 states have internal predecessors, (441), 71 states have call successors, (71), 32 states have call predecessors, (71), 36 states have return successors, (97), 69 states have call predecessors, (97), 67 states have call successors, (97) [2022-11-03 02:17:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 609 transitions. [2022-11-03 02:17:09,170 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 609 transitions. Word has length 38 [2022-11-03 02:17:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:09,171 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 609 transitions. [2022-11-03 02:17:09,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 609 transitions. [2022-11-03 02:17:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:17:09,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:09,175 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:09,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 02:17:09,176 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1787145694, now seen corresponding path program 1 times [2022-11-03 02:17:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:09,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31664187] [2022-11-03 02:17:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:09,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:09,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31664187] [2022-11-03 02:17:09,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31664187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:09,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:09,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478151933] [2022-11-03 02:17:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:09,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:09,308 INFO L87 Difference]: Start difference. First operand 468 states and 609 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:09,738 INFO L93 Difference]: Finished difference Result 481 states and 621 transitions. [2022-11-03 02:17:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:17:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-03 02:17:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:09,742 INFO L225 Difference]: With dead ends: 481 [2022-11-03 02:17:09,742 INFO L226 Difference]: Without dead ends: 465 [2022-11-03 02:17:09,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:09,743 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 20 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:09,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2824 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-11-03 02:17:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2022-11-03 02:17:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 358 states have (on average 1.223463687150838) internal successors, (438), 364 states have internal predecessors, (438), 70 states have call successors, (70), 32 states have call predecessors, (70), 36 states have return successors, (96), 68 states have call predecessors, (96), 66 states have call successors, (96) [2022-11-03 02:17:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 604 transitions. [2022-11-03 02:17:09,804 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 604 transitions. Word has length 37 [2022-11-03 02:17:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:09,804 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 604 transitions. [2022-11-03 02:17:09,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 604 transitions. [2022-11-03 02:17:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:17:09,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:09,806 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 02:17:09,807 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1669999223, now seen corresponding path program 1 times [2022-11-03 02:17:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91210495] [2022-11-03 02:17:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:09,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91210495] [2022-11-03 02:17:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91210495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:09,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595960645] [2022-11-03 02:17:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:09,914 INFO L87 Difference]: Start difference. First operand 465 states and 604 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:10,335 INFO L93 Difference]: Finished difference Result 492 states and 634 transitions. [2022-11-03 02:17:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:10,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-03 02:17:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:10,338 INFO L225 Difference]: With dead ends: 492 [2022-11-03 02:17:10,338 INFO L226 Difference]: Without dead ends: 474 [2022-11-03 02:17:10,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:10,339 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 38 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:10,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2208 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-03 02:17:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 465. [2022-11-03 02:17:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 358 states have (on average 1.223463687150838) internal successors, (438), 364 states have internal predecessors, (438), 70 states have call successors, (70), 32 states have call predecessors, (70), 36 states have return successors, (96), 68 states have call predecessors, (96), 66 states have call successors, (96) [2022-11-03 02:17:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 604 transitions. [2022-11-03 02:17:10,425 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 604 transitions. Word has length 38 [2022-11-03 02:17:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:10,426 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 604 transitions. [2022-11-03 02:17:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 604 transitions. [2022-11-03 02:17:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:17:10,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:10,428 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:10,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 02:17:10,429 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1682429775, now seen corresponding path program 1 times [2022-11-03 02:17:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:10,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842551514] [2022-11-03 02:17:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:10,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:10,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842551514] [2022-11-03 02:17:10,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842551514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:10,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:10,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917615236] [2022-11-03 02:17:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:10,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:10,479 INFO L87 Difference]: Start difference. First operand 465 states and 604 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:10,629 INFO L93 Difference]: Finished difference Result 601 states and 772 transitions. [2022-11-03 02:17:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-03 02:17:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:10,632 INFO L225 Difference]: With dead ends: 601 [2022-11-03 02:17:10,632 INFO L226 Difference]: Without dead ends: 411 [2022-11-03 02:17:10,633 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:10,634 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 2 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:10,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 601 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-03 02:17:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 394. [2022-11-03 02:17:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 305 states have (on average 1.2) internal successors, (366), 308 states have internal predecessors, (366), 60 states have call successors, (60), 28 states have call predecessors, (60), 28 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2022-11-03 02:17:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 487 transitions. [2022-11-03 02:17:10,687 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 487 transitions. Word has length 38 [2022-11-03 02:17:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:10,687 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 487 transitions. [2022-11-03 02:17:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 487 transitions. [2022-11-03 02:17:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:10,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:10,689 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:10,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 02:17:10,690 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1655014524, now seen corresponding path program 1 times [2022-11-03 02:17:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060666435] [2022-11-03 02:17:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:10,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:10,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060666435] [2022-11-03 02:17:10,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060666435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:10,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:10,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392876721] [2022-11-03 02:17:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:10,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:10,733 INFO L87 Difference]: Start difference. First operand 394 states and 487 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:17:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:10,866 INFO L93 Difference]: Finished difference Result 441 states and 542 transitions. [2022-11-03 02:17:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:10,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-11-03 02:17:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:10,869 INFO L225 Difference]: With dead ends: 441 [2022-11-03 02:17:10,869 INFO L226 Difference]: Without dead ends: 394 [2022-11-03 02:17:10,870 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:10,870 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:10,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 592 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-03 02:17:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-11-03 02:17:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 305 states have (on average 1.1967213114754098) internal successors, (365), 308 states have internal predecessors, (365), 60 states have call successors, (60), 28 states have call predecessors, (60), 28 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2022-11-03 02:17:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2022-11-03 02:17:10,920 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 42 [2022-11-03 02:17:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:10,921 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2022-11-03 02:17:10,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 02:17:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2022-11-03 02:17:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:17:10,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:10,922 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:10,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 02:17:10,923 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1793911937, now seen corresponding path program 1 times [2022-11-03 02:17:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:10,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159057509] [2022-11-03 02:17:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:11,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:11,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159057509] [2022-11-03 02:17:11,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159057509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:11,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:11,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380675602] [2022-11-03 02:17:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:11,112 INFO L87 Difference]: Start difference. First operand 394 states and 486 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:11,460 INFO L93 Difference]: Finished difference Result 413 states and 505 transitions. [2022-11-03 02:17:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-03 02:17:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:11,463 INFO L225 Difference]: With dead ends: 413 [2022-11-03 02:17:11,463 INFO L226 Difference]: Without dead ends: 391 [2022-11-03 02:17:11,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:11,464 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 36 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:11,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2072 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-03 02:17:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2022-11-03 02:17:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 303 states have (on average 1.1947194719471947) internal successors, (362), 306 states have internal predecessors, (362), 59 states have call successors, (59), 28 states have call predecessors, (59), 28 states have return successors, (60), 56 states have call predecessors, (60), 55 states have call successors, (60) [2022-11-03 02:17:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2022-11-03 02:17:11,518 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 39 [2022-11-03 02:17:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:11,519 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2022-11-03 02:17:11,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2022-11-03 02:17:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:17:11,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:11,521 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:11,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 02:17:11,521 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -604364024, now seen corresponding path program 1 times [2022-11-03 02:17:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:11,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186051690] [2022-11-03 02:17:11,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:11,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:11,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186051690] [2022-11-03 02:17:11,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186051690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:11,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:11,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:17:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982422845] [2022-11-03 02:17:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:11,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:17:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:17:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:11,789 INFO L87 Difference]: Start difference. First operand 391 states and 481 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:12,318 INFO L93 Difference]: Finished difference Result 423 states and 513 transitions. [2022-11-03 02:17:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-03 02:17:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:12,321 INFO L225 Difference]: With dead ends: 423 [2022-11-03 02:17:12,321 INFO L226 Difference]: Without dead ends: 402 [2022-11-03 02:17:12,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:12,322 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 39 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:12,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2878 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-03 02:17:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2022-11-03 02:17:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 301 states have (on average 1.1926910299003322) internal successors, (359), 304 states have internal predecessors, (359), 58 states have call successors, (58), 28 states have call predecessors, (58), 28 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-11-03 02:17:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 476 transitions. [2022-11-03 02:17:12,375 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 476 transitions. Word has length 41 [2022-11-03 02:17:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:12,375 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 476 transitions. [2022-11-03 02:17:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 476 transitions. [2022-11-03 02:17:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:17:12,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:12,377 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-03 02:17:12,378 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -499652400, now seen corresponding path program 1 times [2022-11-03 02:17:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490417377] [2022-11-03 02:17:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:12,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:12,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490417377] [2022-11-03 02:17:12,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490417377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:12,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:12,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536374405] [2022-11-03 02:17:12,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:12,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:12,539 INFO L87 Difference]: Start difference. First operand 388 states and 476 transitions. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:12,957 INFO L93 Difference]: Finished difference Result 418 states and 505 transitions. [2022-11-03 02:17:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:12,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-03 02:17:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:12,959 INFO L225 Difference]: With dead ends: 418 [2022-11-03 02:17:12,959 INFO L226 Difference]: Without dead ends: 400 [2022-11-03 02:17:12,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:12,960 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 38 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:12,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2287 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-03 02:17:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 386. [2022-11-03 02:17:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.19) internal successors, (357), 303 states have internal predecessors, (357), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-11-03 02:17:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 472 transitions. [2022-11-03 02:17:13,013 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 472 transitions. Word has length 41 [2022-11-03 02:17:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:13,013 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 472 transitions. [2022-11-03 02:17:13,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 472 transitions. [2022-11-03 02:17:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:17:13,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:13,016 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:13,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 02:17:13,016 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash -873948431, now seen corresponding path program 1 times [2022-11-03 02:17:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276444690] [2022-11-03 02:17:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:13,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276444690] [2022-11-03 02:17:13,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276444690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:13,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:13,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890871975] [2022-11-03 02:17:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:13,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:13,152 INFO L87 Difference]: Start difference. First operand 386 states and 472 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:13,540 INFO L93 Difference]: Finished difference Result 402 states and 487 transitions. [2022-11-03 02:17:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2022-11-03 02:17:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:13,542 INFO L225 Difference]: With dead ends: 402 [2022-11-03 02:17:13,543 INFO L226 Difference]: Without dead ends: 384 [2022-11-03 02:17:13,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:13,544 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 36 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:13,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2232 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-03 02:17:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-03 02:17:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 302 states have internal predecessors, (355), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2022-11-03 02:17:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 468 transitions. [2022-11-03 02:17:13,592 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 468 transitions. Word has length 40 [2022-11-03 02:17:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:13,593 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 468 transitions. [2022-11-03 02:17:13,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 468 transitions. [2022-11-03 02:17:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:17:13,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:13,595 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:13,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-03 02:17:13,595 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -223537234, now seen corresponding path program 1 times [2022-11-03 02:17:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152508526] [2022-11-03 02:17:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:13,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:13,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152508526] [2022-11-03 02:17:13,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152508526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:13,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:13,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272590117] [2022-11-03 02:17:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:13,675 INFO L87 Difference]: Start difference. First operand 384 states and 468 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:13,915 INFO L93 Difference]: Finished difference Result 403 states and 487 transitions. [2022-11-03 02:17:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-03 02:17:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:13,918 INFO L225 Difference]: With dead ends: 403 [2022-11-03 02:17:13,918 INFO L226 Difference]: Without dead ends: 367 [2022-11-03 02:17:13,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:13,919 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 44 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1403 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-03 02:17:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-11-03 02:17:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 287 states have (on average 1.181184668989547) internal successors, (339), 290 states have internal predecessors, (339), 51 states have call successors, (51), 28 states have call predecessors, (51), 28 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-03 02:17:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 442 transitions. [2022-11-03 02:17:13,975 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 442 transitions. Word has length 41 [2022-11-03 02:17:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:13,975 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 442 transitions. [2022-11-03 02:17:13,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 442 transitions. [2022-11-03 02:17:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:17:13,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:13,977 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:13,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-03 02:17:13,978 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1897545363, now seen corresponding path program 1 times [2022-11-03 02:17:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381988370] [2022-11-03 02:17:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:14,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381988370] [2022-11-03 02:17:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381988370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:14,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:14,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994181948] [2022-11-03 02:17:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:14,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:14,110 INFO L87 Difference]: Start difference. First operand 367 states and 442 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:14,439 INFO L93 Difference]: Finished difference Result 386 states and 461 transitions. [2022-11-03 02:17:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-03 02:17:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:14,442 INFO L225 Difference]: With dead ends: 386 [2022-11-03 02:17:14,442 INFO L226 Difference]: Without dead ends: 364 [2022-11-03 02:17:14,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:14,443 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 36 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:14,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1839 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-03 02:17:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-11-03 02:17:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 285 states have (on average 1.1789473684210525) internal successors, (336), 288 states have internal predecessors, (336), 50 states have call successors, (50), 28 states have call predecessors, (50), 28 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-11-03 02:17:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 437 transitions. [2022-11-03 02:17:14,489 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 437 transitions. Word has length 41 [2022-11-03 02:17:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:14,489 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 437 transitions. [2022-11-03 02:17:14,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 437 transitions. [2022-11-03 02:17:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:17:14,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:14,491 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-03 02:17:14,491 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 564701893, now seen corresponding path program 1 times [2022-11-03 02:17:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:14,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290524107] [2022-11-03 02:17:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:14,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:14,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290524107] [2022-11-03 02:17:14,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290524107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:14,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:14,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519928889] [2022-11-03 02:17:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:14,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:14,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:14,532 INFO L87 Difference]: Start difference. First operand 364 states and 437 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:14,698 INFO L93 Difference]: Finished difference Result 443 states and 532 transitions. [2022-11-03 02:17:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:14,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-03 02:17:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:14,701 INFO L225 Difference]: With dead ends: 443 [2022-11-03 02:17:14,701 INFO L226 Difference]: Without dead ends: 435 [2022-11-03 02:17:14,702 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:14,702 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 61 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:14,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-03 02:17:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 386. [2022-11-03 02:17:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 305 states have (on average 1.1770491803278689) internal successors, (359), 308 states have internal predecessors, (359), 50 states have call successors, (50), 28 states have call predecessors, (50), 30 states have return successors, (53), 49 states have call predecessors, (53), 46 states have call successors, (53) [2022-11-03 02:17:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 462 transitions. [2022-11-03 02:17:14,753 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 462 transitions. Word has length 41 [2022-11-03 02:17:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:14,753 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 462 transitions. [2022-11-03 02:17:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 462 transitions. [2022-11-03 02:17:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:17:14,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:14,755 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:14,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-03 02:17:14,756 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 238822870, now seen corresponding path program 1 times [2022-11-03 02:17:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991824602] [2022-11-03 02:17:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:14,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991824602] [2022-11-03 02:17:14,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991824602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:14,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:14,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325810387] [2022-11-03 02:17:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:14,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:14,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:14,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:14,923 INFO L87 Difference]: Start difference. First operand 386 states and 462 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:15,291 INFO L93 Difference]: Finished difference Result 423 states and 501 transitions. [2022-11-03 02:17:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:15,291 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), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-03 02:17:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:15,293 INFO L225 Difference]: With dead ends: 423 [2022-11-03 02:17:15,294 INFO L226 Difference]: Without dead ends: 405 [2022-11-03 02:17:15,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:15,296 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 55 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:15,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2090 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-11-03 02:17:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 384. [2022-11-03 02:17:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.174342105263158) internal successors, (357), 307 states have internal predecessors, (357), 49 states have call successors, (49), 28 states have call predecessors, (49), 30 states have return successors, (52), 48 states have call predecessors, (52), 45 states have call successors, (52) [2022-11-03 02:17:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 458 transitions. [2022-11-03 02:17:15,348 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 458 transitions. Word has length 47 [2022-11-03 02:17:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:15,348 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 458 transitions. [2022-11-03 02:17:15,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 458 transitions. [2022-11-03 02:17:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:15,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:15,350 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:15,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 02:17:15,351 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 604390401, now seen corresponding path program 1 times [2022-11-03 02:17:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:15,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87579072] [2022-11-03 02:17:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:15,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87579072] [2022-11-03 02:17:15,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87579072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:15,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:15,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:17:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421612499] [2022-11-03 02:17:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:15,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:17:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:17:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:15,538 INFO L87 Difference]: Start difference. First operand 384 states and 458 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:15,951 INFO L93 Difference]: Finished difference Result 402 states and 476 transitions. [2022-11-03 02:17:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 02:17:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:15,954 INFO L225 Difference]: With dead ends: 402 [2022-11-03 02:17:15,954 INFO L226 Difference]: Without dead ends: 379 [2022-11-03 02:17:15,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:15,955 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 36 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:15,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2557 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-03 02:17:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2022-11-03 02:17:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 300 states have (on average 1.1733333333333333) internal successors, (352), 303 states have internal predecessors, (352), 48 states have call successors, (48), 28 states have call predecessors, (48), 30 states have return successors, (51), 47 states have call predecessors, (51), 44 states have call successors, (51) [2022-11-03 02:17:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 451 transitions. [2022-11-03 02:17:16,009 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 451 transitions. Word has length 42 [2022-11-03 02:17:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 451 transitions. [2022-11-03 02:17:16,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 451 transitions. [2022-11-03 02:17:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:16,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:16,011 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-03 02:17:16,011 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1655406207, now seen corresponding path program 1 times [2022-11-03 02:17:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:16,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879453847] [2022-11-03 02:17:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:16,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879453847] [2022-11-03 02:17:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879453847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:16,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:16,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:17:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150374010] [2022-11-03 02:17:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:16,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:17:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:17:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:16,211 INFO L87 Difference]: Start difference. First operand 379 states and 451 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:16,625 INFO L93 Difference]: Finished difference Result 397 states and 469 transitions. [2022-11-03 02:17:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:16,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 02:17:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:16,628 INFO L225 Difference]: With dead ends: 397 [2022-11-03 02:17:16,628 INFO L226 Difference]: Without dead ends: 376 [2022-11-03 02:17:16,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:16,629 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 36 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:16,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2499 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-03 02:17:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-11-03 02:17:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 298 states have (on average 1.1711409395973154) internal successors, (349), 301 states have internal predecessors, (349), 47 states have call successors, (47), 28 states have call predecessors, (47), 30 states have return successors, (50), 46 states have call predecessors, (50), 43 states have call successors, (50) [2022-11-03 02:17:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 446 transitions. [2022-11-03 02:17:16,679 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 446 transitions. Word has length 42 [2022-11-03 02:17:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:16,679 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 446 transitions. [2022-11-03 02:17:16,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 446 transitions. [2022-11-03 02:17:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:16,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:16,681 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-03 02:17:16,681 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1651680635, now seen corresponding path program 1 times [2022-11-03 02:17:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946518534] [2022-11-03 02:17:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:16,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:16,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946518534] [2022-11-03 02:17:16,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946518534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:16,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:16,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:17:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202308320] [2022-11-03 02:17:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:16,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:17:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:17:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:16,861 INFO L87 Difference]: Start difference. First operand 376 states and 446 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:17,257 INFO L93 Difference]: Finished difference Result 394 states and 464 transitions. [2022-11-03 02:17:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 02:17:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:17,260 INFO L225 Difference]: With dead ends: 394 [2022-11-03 02:17:17,260 INFO L226 Difference]: Without dead ends: 370 [2022-11-03 02:17:17,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:17,261 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 36 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:17,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2449 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-03 02:17:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-11-03 02:17:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 293 states have (on average 1.1706484641638226) internal successors, (343), 296 states have internal predecessors, (343), 46 states have call successors, (46), 28 states have call predecessors, (46), 30 states have return successors, (49), 45 states have call predecessors, (49), 42 states have call successors, (49) [2022-11-03 02:17:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 438 transitions. [2022-11-03 02:17:17,311 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 438 transitions. Word has length 42 [2022-11-03 02:17:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:17,311 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 438 transitions. [2022-11-03 02:17:17,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 438 transitions. [2022-11-03 02:17:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:17,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:17,313 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:17,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-03 02:17:17,313 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 120468561, now seen corresponding path program 1 times [2022-11-03 02:17:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:17,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253649970] [2022-11-03 02:17:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:17,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:17,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253649970] [2022-11-03 02:17:17,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253649970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:17,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:17,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607052764] [2022-11-03 02:17:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:17,421 INFO L87 Difference]: Start difference. First operand 370 states and 438 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:17,693 INFO L93 Difference]: Finished difference Result 389 states and 457 transitions. [2022-11-03 02:17:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-11-03 02:17:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:17,697 INFO L225 Difference]: With dead ends: 389 [2022-11-03 02:17:17,697 INFO L226 Difference]: Without dead ends: 368 [2022-11-03 02:17:17,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:17,698 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 36 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:17,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1688 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-11-03 02:17:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-11-03 02:17:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 292 states have (on average 1.167808219178082) internal successors, (341), 295 states have internal predecessors, (341), 45 states have call successors, (45), 28 states have call predecessors, (45), 30 states have return successors, (48), 44 states have call predecessors, (48), 41 states have call successors, (48) [2022-11-03 02:17:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 434 transitions. [2022-11-03 02:17:17,754 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 434 transitions. Word has length 42 [2022-11-03 02:17:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:17,754 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 434 transitions. [2022-11-03 02:17:17,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 434 transitions. [2022-11-03 02:17:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:17:17,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:17,756 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:17,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-03 02:17:17,756 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 770672267, now seen corresponding path program 1 times [2022-11-03 02:17:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:17,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184581734] [2022-11-03 02:17:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:17,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:17,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184581734] [2022-11-03 02:17:17,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184581734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:17,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:17,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670862895] [2022-11-03 02:17:17,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:17,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:17,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:17,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:17,848 INFO L87 Difference]: Start difference. First operand 368 states and 434 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:18,076 INFO L93 Difference]: Finished difference Result 378 states and 443 transitions. [2022-11-03 02:17:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:18,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-03 02:17:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:18,079 INFO L225 Difference]: With dead ends: 378 [2022-11-03 02:17:18,079 INFO L226 Difference]: Without dead ends: 372 [2022-11-03 02:17:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:18,080 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 53 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:18,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1578 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-03 02:17:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 366. [2022-11-03 02:17:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 290 states have (on average 1.1586206896551725) internal successors, (336), 293 states have internal predecessors, (336), 45 states have call successors, (45), 28 states have call predecessors, (45), 30 states have return successors, (48), 44 states have call predecessors, (48), 41 states have call successors, (48) [2022-11-03 02:17:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 429 transitions. [2022-11-03 02:17:18,128 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 429 transitions. Word has length 42 [2022-11-03 02:17:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:18,129 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 429 transitions. [2022-11-03 02:17:18,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 429 transitions. [2022-11-03 02:17:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:17:18,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:18,131 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:18,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-03 02:17:18,131 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1776318506, now seen corresponding path program 1 times [2022-11-03 02:17:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936297417] [2022-11-03 02:17:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:18,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:18,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936297417] [2022-11-03 02:17:18,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936297417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:18,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:18,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124271420] [2022-11-03 02:17:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:18,212 INFO L87 Difference]: Start difference. First operand 366 states and 429 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:18,589 INFO L93 Difference]: Finished difference Result 415 states and 489 transitions. [2022-11-03 02:17:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:17:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-11-03 02:17:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:18,591 INFO L225 Difference]: With dead ends: 415 [2022-11-03 02:17:18,592 INFO L226 Difference]: Without dead ends: 383 [2022-11-03 02:17:18,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:18,593 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 338 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:18,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 543 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-03 02:17:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 340. [2022-11-03 02:17:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 266 states have (on average 1.1466165413533835) internal successors, (305), 269 states have internal predecessors, (305), 45 states have call successors, (45), 28 states have call predecessors, (45), 28 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-11-03 02:17:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 396 transitions. [2022-11-03 02:17:18,641 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 396 transitions. Word has length 43 [2022-11-03 02:17:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:18,641 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 396 transitions. [2022-11-03 02:17:18,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 396 transitions. [2022-11-03 02:17:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:17:18,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:18,643 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:17:18,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-03 02:17:18,643 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 882045012, now seen corresponding path program 1 times [2022-11-03 02:17:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:18,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261966763] [2022-11-03 02:17:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:17:18,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261966763] [2022-11-03 02:17:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261966763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405514497] [2022-11-03 02:17:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:18,808 INFO L87 Difference]: Start difference. First operand 340 states and 396 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:17:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:19,064 INFO L93 Difference]: Finished difference Result 359 states and 415 transitions. [2022-11-03 02:17:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:19,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-03 02:17:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:19,066 INFO L225 Difference]: With dead ends: 359 [2022-11-03 02:17:19,066 INFO L226 Difference]: Without dead ends: 333 [2022-11-03 02:17:19,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:19,067 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 36 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:19,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1675 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-03 02:17:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-11-03 02:17:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 261 states have (on average 1.1417624521072798) internal successors, (298), 264 states have internal predecessors, (298), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-11-03 02:17:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 385 transitions. [2022-11-03 02:17:19,114 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 385 transitions. Word has length 45 [2022-11-03 02:17:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:19,114 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 385 transitions. [2022-11-03 02:17:19,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:17:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2022-11-03 02:17:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 02:17:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:19,116 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-03 02:17:19,116 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1965128661, now seen corresponding path program 1 times [2022-11-03 02:17:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410427741] [2022-11-03 02:17:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:19,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:19,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410427741] [2022-11-03 02:17:19,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410427741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:19,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:19,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108792408] [2022-11-03 02:17:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:19,226 INFO L87 Difference]: Start difference. First operand 333 states and 385 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:19,474 INFO L93 Difference]: Finished difference Result 352 states and 404 transitions. [2022-11-03 02:17:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-11-03 02:17:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:19,476 INFO L225 Difference]: With dead ends: 352 [2022-11-03 02:17:19,476 INFO L226 Difference]: Without dead ends: 328 [2022-11-03 02:17:19,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:19,477 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 36 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:19,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1602 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-03 02:17:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-11-03 02:17:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 257 states have (on average 1.140077821011673) internal successors, (293), 260 states have internal predecessors, (293), 42 states have call successors, (42), 28 states have call predecessors, (42), 28 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-11-03 02:17:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2022-11-03 02:17:19,530 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 44 [2022-11-03 02:17:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:19,531 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2022-11-03 02:17:19,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:17:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2022-11-03 02:17:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:17:19,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:19,535 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:19,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-03 02:17:19,536 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash -939525806, now seen corresponding path program 1 times [2022-11-03 02:17:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:19,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972816313] [2022-11-03 02:17:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:19,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972816313] [2022-11-03 02:17:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972816313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:19,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:19,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053504937] [2022-11-03 02:17:19,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:19,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:17:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:17:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:19,811 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:20,368 INFO L93 Difference]: Finished difference Result 354 states and 402 transitions. [2022-11-03 02:17:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:17:20,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2022-11-03 02:17:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:20,370 INFO L225 Difference]: With dead ends: 354 [2022-11-03 02:17:20,370 INFO L226 Difference]: Without dead ends: 286 [2022-11-03 02:17:20,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:17:20,371 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 215 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:20,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1100 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-03 02:17:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 270. [2022-11-03 02:17:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 209 states have (on average 1.1531100478468899) internal successors, (241), 211 states have internal predecessors, (241), 37 states have call successors, (37), 25 states have call predecessors, (37), 23 states have return successors, (37), 33 states have call predecessors, (37), 34 states have call successors, (37) [2022-11-03 02:17:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 315 transitions. [2022-11-03 02:17:20,417 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 315 transitions. Word has length 46 [2022-11-03 02:17:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:20,417 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 315 transitions. [2022-11-03 02:17:20,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:17:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 315 transitions. [2022-11-03 02:17:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:17:20,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:20,419 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:20,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-03 02:17:20,419 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -148792325, now seen corresponding path program 1 times [2022-11-03 02:17:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:20,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147233403] [2022-11-03 02:17:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:20,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147233403] [2022-11-03 02:17:20,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147233403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:20,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:20,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781154440] [2022-11-03 02:17:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:20,573 INFO L87 Difference]: Start difference. First operand 270 states and 315 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:20,844 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-11-03 02:17:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:20,845 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), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-03 02:17:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:20,857 INFO L225 Difference]: With dead ends: 289 [2022-11-03 02:17:20,858 INFO L226 Difference]: Without dead ends: 262 [2022-11-03 02:17:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:20,859 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 37 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:20,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1569 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-03 02:17:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-03 02:17:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.1477832512315271) internal successors, (233), 205 states have internal predecessors, (233), 35 states have call successors, (35), 25 states have call predecessors, (35), 23 states have return successors, (35), 31 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-03 02:17:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 303 transitions. [2022-11-03 02:17:20,907 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 303 transitions. Word has length 47 [2022-11-03 02:17:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:20,907 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 303 transitions. [2022-11-03 02:17:20,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2022-11-03 02:17:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:17:20,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:20,909 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:20,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-03 02:17:20,909 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash -212821284, now seen corresponding path program 1 times [2022-11-03 02:17:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411502489] [2022-11-03 02:17:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:21,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:21,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411502489] [2022-11-03 02:17:21,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411502489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:21,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:21,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679242023] [2022-11-03 02:17:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:21,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:21,103 INFO L87 Difference]: Start difference. First operand 262 states and 303 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:17:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:21,304 INFO L93 Difference]: Finished difference Result 360 states and 419 transitions. [2022-11-03 02:17:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-11-03 02:17:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:21,306 INFO L225 Difference]: With dead ends: 360 [2022-11-03 02:17:21,306 INFO L226 Difference]: Without dead ends: 260 [2022-11-03 02:17:21,306 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:21,307 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 13 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:21,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 915 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-03 02:17:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-11-03 02:17:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 201 states have (on average 1.144278606965174) internal successors, (230), 203 states have internal predecessors, (230), 35 states have call successors, (35), 25 states have call predecessors, (35), 23 states have return successors, (35), 31 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-03 02:17:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2022-11-03 02:17:21,380 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 50 [2022-11-03 02:17:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:21,381 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2022-11-03 02:17:21,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:17:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2022-11-03 02:17:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 02:17:21,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:21,382 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:21,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-03 02:17:21,383 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1441347016, now seen corresponding path program 1 times [2022-11-03 02:17:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362420705] [2022-11-03 02:17:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:21,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362420705] [2022-11-03 02:17:21,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362420705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:21,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:21,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793451216] [2022-11-03 02:17:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:21,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:21,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:21,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:21,557 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:21,813 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2022-11-03 02:17:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:17:21,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2022-11-03 02:17:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:21,815 INFO L225 Difference]: With dead ends: 274 [2022-11-03 02:17:21,815 INFO L226 Difference]: Without dead ends: 255 [2022-11-03 02:17:21,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:21,816 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 20 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:21,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1644 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-03 02:17:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-03 02:17:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.1414141414141414) internal successors, (226), 200 states have internal predecessors, (226), 33 states have call successors, (33), 25 states have call predecessors, (33), 23 states have return successors, (33), 29 states have call predecessors, (33), 30 states have call successors, (33) [2022-11-03 02:17:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 292 transitions. [2022-11-03 02:17:21,867 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 292 transitions. Word has length 54 [2022-11-03 02:17:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:21,867 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 292 transitions. [2022-11-03 02:17:21,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:17:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 292 transitions. [2022-11-03 02:17:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:17:21,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:21,869 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:21,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-03 02:17:21,869 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1337686704, now seen corresponding path program 1 times [2022-11-03 02:17:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:21,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092949191] [2022-11-03 02:17:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:22,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:22,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092949191] [2022-11-03 02:17:22,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092949191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:22,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:22,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077369372] [2022-11-03 02:17:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:22,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:22,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:22,007 INFO L87 Difference]: Start difference. First operand 255 states and 292 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:22,231 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2022-11-03 02:17:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:17:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-03 02:17:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:22,233 INFO L225 Difference]: With dead ends: 257 [2022-11-03 02:17:22,233 INFO L226 Difference]: Without dead ends: 220 [2022-11-03 02:17:22,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:22,234 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 20 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:22,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1516 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-03 02:17:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-03 02:17:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 169 states have internal predecessors, (195), 30 states have call successors, (30), 23 states have call predecessors, (30), 21 states have return successors, (31), 27 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 02:17:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2022-11-03 02:17:22,274 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 47 [2022-11-03 02:17:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:22,274 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2022-11-03 02:17:22,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:17:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2022-11-03 02:17:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 02:17:22,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:22,276 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:17:22,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-03 02:17:22,276 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 799060123, now seen corresponding path program 1 times [2022-11-03 02:17:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:22,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875669357] [2022-11-03 02:17:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:17:22,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875669357] [2022-11-03 02:17:22,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875669357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:17:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557237152] [2022-11-03 02:17:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:22,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:22,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:17:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:22,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:17:22,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:22,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:17:22,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557237152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:22,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:17:22,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2022-11-03 02:17:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152983345] [2022-11-03 02:17:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:22,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:22,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:22,653 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:17:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:22,807 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2022-11-03 02:17:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-03 02:17:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:22,808 INFO L225 Difference]: With dead ends: 243 [2022-11-03 02:17:22,809 INFO L226 Difference]: Without dead ends: 202 [2022-11-03 02:17:22,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:22,810 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:22,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-03 02:17:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-11-03 02:17:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.1699346405228759) internal successors, (179), 154 states have internal predecessors, (179), 27 states have call successors, (27), 23 states have call predecessors, (27), 21 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-03 02:17:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2022-11-03 02:17:22,868 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 49 [2022-11-03 02:17:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:22,868 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2022-11-03 02:17:22,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:17:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2022-11-03 02:17:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:17:22,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:22,870 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:22,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:23,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-11-03 02:17:23,086 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash -604905461, now seen corresponding path program 1 times [2022-11-03 02:17:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:23,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668797279] [2022-11-03 02:17:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:23,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:23,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668797279] [2022-11-03 02:17:23,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668797279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:23,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:23,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244982557] [2022-11-03 02:17:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:23,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:23,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:23,227 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:23,497 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2022-11-03 02:17:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2022-11-03 02:17:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:23,499 INFO L225 Difference]: With dead ends: 239 [2022-11-03 02:17:23,499 INFO L226 Difference]: Without dead ends: 221 [2022-11-03 02:17:23,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:23,500 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:23,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1076 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-03 02:17:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-11-03 02:17:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 155 states have (on average 1.167741935483871) internal successors, (181), 156 states have internal predecessors, (181), 27 states have call successors, (27), 23 states have call predecessors, (27), 21 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-03 02:17:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2022-11-03 02:17:23,539 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 50 [2022-11-03 02:17:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:23,539 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2022-11-03 02:17:23,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2022-11-03 02:17:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 02:17:23,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:23,541 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-03 02:17:23,541 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 851033653, now seen corresponding path program 1 times [2022-11-03 02:17:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:23,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305882321] [2022-11-03 02:17:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:23,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305882321] [2022-11-03 02:17:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305882321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:23,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:23,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689766559] [2022-11-03 02:17:23,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:23,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:23,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:23,628 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 02:17:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:23,835 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2022-11-03 02:17:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:17:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2022-11-03 02:17:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:23,837 INFO L225 Difference]: With dead ends: 304 [2022-11-03 02:17:23,837 INFO L226 Difference]: Without dead ends: 206 [2022-11-03 02:17:23,837 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:17:23,838 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 152 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:23,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 307 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-03 02:17:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-11-03 02:17:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 155 states have (on average 1.1612903225806452) internal successors, (180), 156 states have internal predecessors, (180), 27 states have call successors, (27), 23 states have call predecessors, (27), 21 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-03 02:17:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 235 transitions. [2022-11-03 02:17:23,874 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 235 transitions. Word has length 54 [2022-11-03 02:17:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:23,874 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 235 transitions. [2022-11-03 02:17:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 02:17:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 235 transitions. [2022-11-03 02:17:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 02:17:23,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:23,876 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:23,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-03 02:17:23,876 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -284564752, now seen corresponding path program 1 times [2022-11-03 02:17:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:23,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574712364] [2022-11-03 02:17:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:24,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:24,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574712364] [2022-11-03 02:17:24,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574712364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:24,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:24,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756208817] [2022-11-03 02:17:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:24,038 INFO L87 Difference]: Start difference. First operand 204 states and 235 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:24,351 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2022-11-03 02:17:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2022-11-03 02:17:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:24,363 INFO L225 Difference]: With dead ends: 223 [2022-11-03 02:17:24,363 INFO L226 Difference]: Without dead ends: 202 [2022-11-03 02:17:24,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:24,364 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 36 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:24,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1026 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-03 02:17:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-11-03 02:17:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 154 states have internal predecessors, (177), 27 states have call successors, (27), 23 states have call predecessors, (27), 21 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-03 02:17:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2022-11-03 02:17:24,434 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 51 [2022-11-03 02:17:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:24,434 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2022-11-03 02:17:24,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:17:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2022-11-03 02:17:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 02:17:24,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:24,436 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:24,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-03 02:17:24,436 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 388568596, now seen corresponding path program 1 times [2022-11-03 02:17:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:24,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012170748] [2022-11-03 02:17:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:24,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:24,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012170748] [2022-11-03 02:17:24,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012170748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:24,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:24,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333709110] [2022-11-03 02:17:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:24,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:24,516 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:17:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:24,625 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-11-03 02:17:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2022-11-03 02:17:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:24,627 INFO L225 Difference]: With dead ends: 216 [2022-11-03 02:17:24,627 INFO L226 Difference]: Without dead ends: 159 [2022-11-03 02:17:24,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:24,628 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:24,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-03 02:17:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-11-03 02:17:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.15) internal successors, (138), 121 states have internal predecessors, (138), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (22), 18 states have call predecessors, (22), 19 states have call successors, (22) [2022-11-03 02:17:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2022-11-03 02:17:24,672 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 51 [2022-11-03 02:17:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:24,672 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2022-11-03 02:17:24,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:17:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2022-11-03 02:17:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-03 02:17:24,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:24,674 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:24,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-03 02:17:24,674 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1434544927, now seen corresponding path program 1 times [2022-11-03 02:17:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:24,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456123054] [2022-11-03 02:17:24,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:24,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:24,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456123054] [2022-11-03 02:17:24,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456123054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:24,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:24,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629830845] [2022-11-03 02:17:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:24,777 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:17:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:24,950 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2022-11-03 02:17:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-11-03 02:17:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:24,951 INFO L225 Difference]: With dead ends: 161 [2022-11-03 02:17:24,951 INFO L226 Difference]: Without dead ends: 158 [2022-11-03 02:17:24,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:24,952 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 147 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:24,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 194 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-03 02:17:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2022-11-03 02:17:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.1) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (19), 15 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-03 02:17:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-11-03 02:17:24,983 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 55 [2022-11-03 02:17:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:24,983 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-11-03 02:17:24,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:17:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-11-03 02:17:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-03 02:17:24,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:24,985 INFO L195 NwaCegarLoop]: 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] [2022-11-03 02:17:24,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-03 02:17:24,985 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1064539222, now seen corresponding path program 1 times [2022-11-03 02:17:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:24,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385620586] [2022-11-03 02:17:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:25,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385620586] [2022-11-03 02:17:25,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385620586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:25,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:17:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694380912] [2022-11-03 02:17:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:25,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:25,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:25,067 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:17:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:25,185 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2022-11-03 02:17:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:25,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-11-03 02:17:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:25,197 INFO L225 Difference]: With dead ends: 151 [2022-11-03 02:17:25,197 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 02:17:25,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:25,198 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 55 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:25,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 435 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 02:17:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-03 02:17:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.09) internal successors, (109), 101 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (19), 15 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-03 02:17:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-03 02:17:25,228 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 69 [2022-11-03 02:17:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:25,228 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-03 02:17:25,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:17:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-03 02:17:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-03 02:17:25,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:25,230 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-03 02:17:25,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-03 02:17:25,230 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -195059814, now seen corresponding path program 1 times [2022-11-03 02:17:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:25,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521210427] [2022-11-03 02:17:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:25,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:25,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521210427] [2022-11-03 02:17:25,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521210427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:25,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:25,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:17:25,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925031536] [2022-11-03 02:17:25,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:25,349 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:17:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:25,530 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2022-11-03 02:17:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:17:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-11-03 02:17:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:25,532 INFO L225 Difference]: With dead ends: 183 [2022-11-03 02:17:25,532 INFO L226 Difference]: Without dead ends: 96 [2022-11-03 02:17:25,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:25,533 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 89 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:25,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 523 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-03 02:17:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-11-03 02:17:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 02:17:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-11-03 02:17:25,555 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 71 [2022-11-03 02:17:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:25,555 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-11-03 02:17:25,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:17:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-11-03 02:17:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-03 02:17:25,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:25,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:25,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-03 02:17:25,557 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash -230617130, now seen corresponding path program 1 times [2022-11-03 02:17:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:25,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47619344] [2022-11-03 02:17:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:17:25,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47619344] [2022-11-03 02:17:25,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47619344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:25,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:25,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029858932] [2022-11-03 02:17:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:25,739 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:17:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:25,908 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-11-03 02:17:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2022-11-03 02:17:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:25,909 INFO L225 Difference]: With dead ends: 87 [2022-11-03 02:17:25,909 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:17:25,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:25,910 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:25,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 356 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:17:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:17:25,911 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) [2022-11-03 02:17:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:17:25,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-11-03 02:17:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:25,912 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:17:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:17:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:17:25,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:17:25,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:17:25,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-03 02:17:25,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:17:49,306 WARN L234 SmtUtils]: Spent 23.38s on a formula simplification. DAG size of input: 245 DAG size of output: 245 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:19:56,744 WARN L234 SmtUtils]: Spent 2.12m on a formula simplification that was a NOOP. DAG size: 253 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:20:19,577 WARN L234 SmtUtils]: Spent 22.80s on a formula simplification. DAG size of input: 238 DAG size of output: 238 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:21:39,980 WARN L234 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 246 DAG size of output: 246 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:21:59,224 INFO L895 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (<= 3 ~SKIP1~0))) (.cse8 (= ~MPR3~0 1)) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (<= 7 ~IPC~0)) .cse3 .cse4 (and (let ((.cse5 (+ ~myStatus~0 1073741637))) (or (not (<= .cse5 0)) (not (<= 0 .cse5)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= ~compRegistered~0 ~routine~0)) .cse6 .cse7 (not (= ~compRegistered~0 1)) .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) (= ~IPC~0 2) .cse3 .cse4 (not (= ~routine~0 0)) .cse6 .cse7 .cse8 .cse9))) [2022-11-03 02:21:59,224 INFO L899 garLoopResultBuilder]: For program point SendSrbSynchronousEXIT(lines 85 130) no Hoare annotation was computed. [2022-11-03 02:21:59,225 INFO L899 garLoopResultBuilder]: For program point L123-1(line 123) no Hoare annotation was computed. [2022-11-03 02:21:59,225 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 126) no Hoare annotation was computed. [2022-11-03 02:21:59,225 INFO L899 garLoopResultBuilder]: For program point L121-2(lines 121 126) no Hoare annotation was computed. [2022-11-03 02:21:59,225 INFO L895 garLoopResultBuilder]: At program point SendSrbSynchronousENTRY(lines 85 130) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (= ~customIrp~0 0)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (<= 3 ~SKIP1~0))) (.cse8 (= ~MPR3~0 1)) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (and (= ~s~0 ~NP~0) .cse3) (not (= ~compRegistered~0 0)) (= ~IPC~0 2) .cse4 .cse5 (not (= ~routine~0 0)) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (<= 7 ~IPC~0)) (and .cse3 (= ~s~0 |old(~s~0)|)) .cse4 .cse5 (and (let ((.cse10 (+ ~myStatus~0 1073741637))) (or (not (<= .cse10 0)) (not (<= 0 .cse10)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= ~compRegistered~0 ~routine~0)) .cse6 .cse7 (not (= ~compRegistered~0 1)) .cse8 .cse9))) [2022-11-03 02:21:59,226 INFO L899 garLoopResultBuilder]: For program point SendSrbSynchronousFINAL(lines 85 130) no Hoare annotation was computed. [2022-11-03 02:21:59,229 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 101 129) no Hoare annotation was computed. [2022-11-03 02:21:59,230 INFO L902 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 1993 2000) the Hoare annotation is: true [2022-11-03 02:21:59,230 INFO L899 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 1993 2000) no Hoare annotation was computed. [2022-11-03 02:21:59,230 INFO L902 garLoopResultBuilder]: At program point CdAudioSignalCompletionENTRY(lines 131 140) the Hoare annotation is: true [2022-11-03 02:21:59,230 INFO L902 garLoopResultBuilder]: At program point L136(line 136) the Hoare annotation is: true [2022-11-03 02:21:59,230 INFO L899 garLoopResultBuilder]: For program point L136-1(line 136) no Hoare annotation was computed. [2022-11-03 02:21:59,230 INFO L899 garLoopResultBuilder]: For program point CdAudioSignalCompletionEXIT(lines 131 140) no Hoare annotation was computed. [2022-11-03 02:21:59,231 INFO L895 garLoopResultBuilder]: At program point AG_SetStatusAndReturnENTRY(lines 877 893) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= ~routine~0 0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (<= 3 ~SKIP1~0))) (.cse8 (= ~MPR3~0 1)) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) (= ~IPC~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (= ~customIrp~0 0)) .cse1 .cse2 (not (<= 7 ~IPC~0)) (and (or (not (<= |old(~myStatus~0)| 0)) (not (<= 0 |old(~myStatus~0)|))) (let ((.cse10 (+ |old(~myStatus~0)| 1073741637))) (or (not (<= .cse10 0)) (not (<= 0 .cse10))))) .cse3 .cse4 .cse5 (let ((.cse11 (+ ~myStatus~0 1073741637))) (and (<= .cse11 0) (<= 0 .cse11))) .cse6 (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0)) .cse7 .cse8 .cse9))) [2022-11-03 02:21:59,231 INFO L899 garLoopResultBuilder]: For program point AG_SetStatusAndReturnEXIT(lines 877 893) no Hoare annotation was computed. [2022-11-03 02:21:59,231 INFO L895 garLoopResultBuilder]: At program point L889(line 889) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= 3 ~SKIP1~0))) (.cse9 (= ~MPR3~0 1)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~customIrp~0 0)) .cse1 .cse2 (not (<= 7 ~IPC~0)) (and (or (not (<= |old(~myStatus~0)| 0)) (not (<= 0 |old(~myStatus~0)|))) (let ((.cse3 (+ |old(~myStatus~0)| 1073741637))) (or (not (<= .cse3 0)) (not (<= 0 .cse3))))) (= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (and (= ~s~0 ~NP~0) (<= AG_SetStatusAndReturn_~status |AG_SetStatusAndReturn_#in~status|)) (= ~IPC~0 2) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:21:59,232 INFO L899 garLoopResultBuilder]: For program point L889-1(line 889) no Hoare annotation was computed. [2022-11-03 02:21:59,232 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 55 62) the Hoare annotation is: true [2022-11-03 02:21:59,232 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 55 62) no Hoare annotation was computed. [2022-11-03 02:21:59,232 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2022-11-03 02:21:59,232 INFO L895 garLoopResultBuilder]: At program point L1918(line 1918) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse11 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (= |old(~pended~0)| 0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse15 (+ ~myStatus~0 1073741637))) (or (not (<= .cse15 0)) (not (<= 0 .cse15)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse14 (not (= ~compRegistered~0 1))) (.cse10 (= ~MPR3~0 1))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= ~compRegistered~0 ~routine~0)) .cse8 .cse9 (let ((.cse12 (+ IofCallDriver_~__cil_tmp8~1 1073741802)) (.cse13 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse12) (<= .cse13 0) (<= .cse12 0) (<= 0 .cse13) (= ~pended~0 0) (= ~s~0 |old(~s~0)|))) .cse14 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10))) [2022-11-03 02:21:59,233 INFO L895 garLoopResultBuilder]: At program point L1910(line 1910) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (= |old(~pended~0)| 0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse12 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse13 (+ ~myStatus~0 1073741637))) (or (not (<= .cse13 0)) (not (<= 0 .cse13)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) .cse8 .cse9 .cse10 .cse11 (and (= ~pended~0 0) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-11-03 02:21:59,233 INFO L899 garLoopResultBuilder]: For program point L1910-1(line 1910) no Hoare annotation was computed. [2022-11-03 02:21:59,233 INFO L899 garLoopResultBuilder]: For program point L1902(lines 1902 1922) no Hoare annotation was computed. [2022-11-03 02:21:59,234 INFO L895 garLoopResultBuilder]: At program point L1902-1(lines 1901 1977) the Hoare annotation is: (let ((.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse13 (not (= ~compRegistered~0 1))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (= |old(~pended~0)| 0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse15 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse16 (+ ~myStatus~0 1073741637))) (or (not (<= .cse16 0)) (not (<= 0 .cse16)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse10 (= ~pended~0 0)) (.cse11 (not (= 2 ~DC~0))) (.cse12 (not (<= 3 ~SKIP1~0))) (.cse14 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) (let ((.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802)) (.cse9 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse8) (<= .cse9 0) (<= .cse8 0) (<= 0 .cse9) .cse10 (= ~MPR1~0 ~s~0))) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s~0 ~NP~0) .cse5 .cse6 .cse15 .cse7 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~SKIP1~0 ~s~0) .cse10) .cse11 .cse12 .cse14))) [2022-11-03 02:21:59,234 INFO L895 garLoopResultBuilder]: At program point L1948(lines 1901 1977) the Hoare annotation is: (let ((.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse13 (not (= ~compRegistered~0 1))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (= |old(~pended~0)| 0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse15 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse16 (+ ~myStatus~0 1073741637))) (or (not (<= .cse16 0)) (not (<= 0 .cse16)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse10 (= ~pended~0 0)) (.cse11 (not (= 2 ~DC~0))) (.cse12 (not (<= 3 ~SKIP1~0))) (.cse14 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) (let ((.cse8 (+ IofCallDriver_~__cil_tmp8~1 1073741802)) (.cse9 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse8) (<= .cse9 0) (<= .cse8 0) (<= 0 .cse9) .cse10 (= ~MPR1~0 ~s~0))) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s~0 ~NP~0) .cse5 .cse6 .cse15 .cse7 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~SKIP1~0 ~s~0) .cse10) .cse11 .cse12 .cse14))) [2022-11-03 02:21:59,234 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 1894 1978) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse12 (= ~pended~0 0)) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (= |old(~pended~0)| 0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse13 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse14 (+ ~myStatus~0 1073741637))) (or (not (<= .cse14 0)) (not (<= 0 .cse14)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) .cse8 .cse9 .cse10 .cse11 (and .cse12 (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~SKIP1~0 ~s~0) .cse12) .cse8 .cse9 .cse11) (or .cse0 .cse1 (and (= ~s~0 ~NP~0) .cse12) .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point L1903(lines 1903 1913) no Hoare annotation was computed. [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point L1957(lines 1957 1974) no Hoare annotation was computed. [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point L1916(lines 1916 1920) no Hoare annotation was computed. [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 1894 1978) no Hoare annotation was computed. [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point L1908(lines 1908 1912) no Hoare annotation was computed. [2022-11-03 02:21:59,235 INFO L899 garLoopResultBuilder]: For program point L1908-2(lines 1903 1913) no Hoare annotation was computed. [2022-11-03 02:21:59,236 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2022-11-03 02:21:59,236 INFO L895 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse11 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (= |old(~pended~0)| 0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse13 (+ ~myStatus~0 1073741637))) (or (not (<= .cse13 0)) (not (<= 0 .cse13)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse12 (not (= ~compRegistered~0 1))) (.cse10 (= ~MPR3~0 1))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= ~compRegistered~0 ~routine~0)) .cse8 .cse9 .cse12 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10))) [2022-11-03 02:21:59,236 INFO L899 garLoopResultBuilder]: For program point L1971-1(lines 1953 1975) no Hoare annotation was computed. [2022-11-03 02:21:59,236 INFO L895 garLoopResultBuilder]: At program point L1905(line 1905) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~customIrp~0 0))) (.cse11 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (= |old(~pended~0)| 0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (and (let ((.cse13 (+ ~myStatus~0 1073741637))) (or (not (<= .cse13 0)) (not (<= 0 .cse13)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse12 (not (= ~compRegistered~0 1))) (.cse10 (= ~MPR3~0 1))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse7 (not (= ~compRegistered~0 ~routine~0)) .cse8 .cse9 .cse12 .cse10) (or .cse0 .cse1 (and (= ~s~0 ~NP~0) (= ~pended~0 0)) .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10))) [2022-11-03 02:21:59,237 INFO L899 garLoopResultBuilder]: For program point L1905-1(line 1905) no Hoare annotation was computed. [2022-11-03 02:21:59,237 INFO L895 garLoopResultBuilder]: At program point L1888(line 1888) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~customIrp~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= ~compRegistered~0 ~routine~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (not (= ~compRegistered~0 1)) (= ~MPR3~0 1) (not (= ~pended~0 0))) [2022-11-03 02:21:59,237 INFO L899 garLoopResultBuilder]: For program point L1888-1(lines 1880 1893) no Hoare annotation was computed. [2022-11-03 02:21:59,237 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 1880 1893) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~customIrp~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= ~compRegistered~0 ~routine~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (<= 3 ~SKIP1~0)) (not (= ~compRegistered~0 1)) (= ~MPR3~0 1) (not (= ~pended~0 0))) [2022-11-03 02:21:59,238 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 1880 1893) no Hoare annotation was computed. [2022-11-03 02:21:59,238 INFO L895 garLoopResultBuilder]: At program point L383(line 383) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= |old(~pended~0)| 0)) (= ~IPC~0 2) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (and (= ~SKIP1~0 ~s~0) (= ~pended~0 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,238 INFO L895 garLoopResultBuilder]: At program point CdAudioSendToNextDriverENTRY(lines 366 387) the Hoare annotation is: (or (not (= ~NP~0 1)) (and (= ~s~0 ~NP~0) (= ~pended~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= |old(~pended~0)| 0)) (= ~IPC~0 2) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,238 INFO L899 garLoopResultBuilder]: For program point L383-1(line 383) no Hoare annotation was computed. [2022-11-03 02:21:59,238 INFO L895 garLoopResultBuilder]: At program point L377(line 377) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (not (= |old(~pended~0)| 0)) (= ~IPC~0 2) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,239 INFO L899 garLoopResultBuilder]: For program point L377-1(lines 373 379) no Hoare annotation was computed. [2022-11-03 02:21:59,239 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 379) no Hoare annotation was computed. [2022-11-03 02:21:59,239 INFO L899 garLoopResultBuilder]: For program point CdAudioSendToNextDriverEXIT(lines 366 387) no Hoare annotation was computed. [2022-11-03 02:21:59,239 INFO L895 garLoopResultBuilder]: At program point CdAudioIsPlayActiveENTRY(lines 388 432) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= ~customIrp~0 0)) (not (= ~compRegistered~0 0)) (= ~IPC~0 2) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1) (not (= ~pended~0 0))) [2022-11-03 02:21:59,239 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 409) no Hoare annotation was computed. [2022-11-03 02:21:59,239 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-11-03 02:21:59,240 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= ~customIrp~0 0)) (not (= ~compRegistered~0 0)) (= ~IPC~0 2) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1) (not (= ~pended~0 0))) [2022-11-03 02:21:59,240 INFO L899 garLoopResultBuilder]: For program point L414-1(line 414) no Hoare annotation was computed. [2022-11-03 02:21:59,240 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2022-11-03 02:21:59,240 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 400 431) no Hoare annotation was computed. [2022-11-03 02:21:59,240 INFO L899 garLoopResultBuilder]: For program point CdAudioIsPlayActiveEXIT(lines 388 432) no Hoare annotation was computed. [2022-11-03 02:21:59,240 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 406) no Hoare annotation was computed. [2022-11-03 02:21:59,241 INFO L899 garLoopResultBuilder]: For program point CdAudioIsPlayActiveFINAL(lines 388 432) no Hoare annotation was computed. [2022-11-03 02:21:59,241 INFO L899 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 2001 2042) no Hoare annotation was computed. [2022-11-03 02:21:59,241 INFO L899 garLoopResultBuilder]: For program point L2007(lines 2007 2012) no Hoare annotation was computed. [2022-11-03 02:21:59,241 INFO L895 garLoopResultBuilder]: At program point L2014(lines 2006 2025) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (and (let ((.cse13 (+ ~myStatus~0 1073741637))) (or (not (<= .cse13 0)) (not (<= 0 .cse13)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse3 (= ~customIrp~0 0)) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (= ~MPR3~0 1)) (.cse11 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (and (= ~s~0 ~NP~0) .cse3) (not (= ~compRegistered~0 0)) .cse4 .cse5 .cse6 (not (= ~routine~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (not (= ~MPR3~0 |old(~s~0)|)))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (and (= ~setEventCalled~0 1) .cse3 (= ~s~0 |old(~s~0)|) .cse12) (not (= ~compRegistered~0 ~routine~0)) (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse9 (not (= ~compRegistered~0 1)) (and .cse2 .cse12) .cse10 .cse11)))) [2022-11-03 02:21:59,242 INFO L899 garLoopResultBuilder]: For program point L2006(lines 2006 2025) no Hoare annotation was computed. [2022-11-03 02:21:59,242 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 2001 2042) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse3 (= ~customIrp~0 0)) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (and (let ((.cse12 (+ ~myStatus~0 1073741637))) (or (not (<= .cse12 0)) (not (<= 0 .cse12)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (= ~MPR3~0 1)) (.cse11 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (and (= ~s~0 ~NP~0) .cse3) (not (= ~compRegistered~0 0)) .cse4 .cse5 .cse6 (not (= ~routine~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (and (= ~setEventCalled~0 1) .cse3 (= ~s~0 |old(~s~0)|)) .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse9 (not (= ~compRegistered~0 1)) (and .cse2 (not (= ~MPR3~0 |old(~s~0)|))) .cse10 .cse11))) [2022-11-03 02:21:59,242 INFO L895 garLoopResultBuilder]: At program point L2021(line 2021) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (and (let ((.cse11 (+ ~myStatus~0 1073741637))) (or (not (<= .cse11 0)) (not (<= 0 .cse11)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse9 (= ~MPR3~0 1)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse3 .cse4 .cse5 (not (= ~routine~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= ~compRegistered~0 ~routine~0)) (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~compRegistered~0 1)) (and .cse2 (not (= ~MPR3~0 |old(~s~0)|))) .cse9 .cse10))) [2022-11-03 02:21:59,242 INFO L899 garLoopResultBuilder]: For program point L2019(lines 2019 2023) no Hoare annotation was computed. [2022-11-03 02:21:59,243 INFO L895 garLoopResultBuilder]: At program point L2019-1(lines 2006 2025) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= |old(~customIrp~0)| 0))) (.cse3 (and (= ~s~0 ~NP~0) (= ~customIrp~0 0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (and (let ((.cse12 (+ ~myStatus~0 1073741637))) (or (not (<= .cse12 0)) (not (<= 0 .cse12)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0))))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (= ~MPR3~0 1)) (.cse11 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4 .cse5 .cse6 (not (= ~routine~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 ~routine~0)) (not (= |old(~setEventCalled~0)| 1)) .cse8 .cse9 (not (= ~compRegistered~0 1)) (and .cse2 (not (= ~MPR3~0 |old(~s~0)|))) .cse10 .cse11))) [2022-11-03 02:21:59,243 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1989) no Hoare annotation was computed. [2022-11-03 02:21:59,243 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 1979 1992) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (not (<= 3 ~SKIP1~0))) (.cse6 (= ~MPR3~0 1)) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (= ~IPC~0 2) .cse2 .cse3 (not (= ~routine~0 0)) .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= ~customIrp~0 0)) .cse1 (not (<= 7 ~IPC~0)) .cse2 .cse3 (not (= ~compRegistered~0 ~routine~0)) .cse4 (= ~s~0 |old(~s~0)|) .cse5 (not (= ~compRegistered~0 1)) .cse6 .cse7))) [2022-11-03 02:21:59,243 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 1979 1992) no Hoare annotation was computed. [2022-11-03 02:21:59,244 INFO L895 garLoopResultBuilder]: At program point L1987(line 1987) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (not (<= 3 ~SKIP1~0))) (.cse6 (= ~MPR3~0 1)) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~customIrp~0 0)) .cse1 (not (<= 7 ~IPC~0)) .cse2 .cse3 (not (= ~compRegistered~0 ~routine~0)) .cse4 .cse5 (not (= ~compRegistered~0 1)) .cse6 .cse7) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) (= ~IPC~0 2) .cse2 .cse3 (not (= ~routine~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-11-03 02:21:59,244 INFO L899 garLoopResultBuilder]: For program point L1987-1(lines 1979 1992) no Hoare annotation was computed. [2022-11-03 02:21:59,244 INFO L895 garLoopResultBuilder]: At program point L1555(lines 1500 1557) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~routine~0 0)) (.cse2 (<= 3 ~SKIP1~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (<= 4 ~SKIP2~0)) (.cse7 (= ~pended~0 0)) (.cse8 (= ~compRegistered~0 0))) (or (and (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1|) (= 2 ~DC~0) .cse0 .cse1 .cse2 .cse3 (= ~customIrp~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~SKIP2~0 ~s~0)) (and (= ~s~0 ~DC~0) (= 2 ~s~0) (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0) .cse5 .cse6 .cse7 .cse8))) [2022-11-03 02:21:59,244 INFO L895 garLoopResultBuilder]: At program point L829(line 829) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,245 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-11-03 02:21:59,245 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1694) no Hoare annotation was computed. [2022-11-03 02:21:59,245 INFO L899 garLoopResultBuilder]: For program point L301(line 301) no Hoare annotation was computed. [2022-11-03 02:21:59,245 INFO L895 garLoopResultBuilder]: At program point L1226(line 1226) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,245 INFO L899 garLoopResultBuilder]: For program point L1226-1(line 1226) no Hoare annotation was computed. [2022-11-03 02:21:59,246 INFO L895 garLoopResultBuilder]: At program point L236(lines 236 308) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,246 INFO L899 garLoopResultBuilder]: For program point L1161(lines 1161 1173) no Hoare annotation was computed. [2022-11-03 02:21:59,246 INFO L895 garLoopResultBuilder]: At program point L765(line 765) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741823) 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,246 INFO L899 garLoopResultBuilder]: For program point L765-1(line 765) no Hoare annotation was computed. [2022-11-03 02:21:59,246 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-11-03 02:21:59,246 INFO L899 garLoopResultBuilder]: For program point L633(lines 633 851) no Hoare annotation was computed. [2022-11-03 02:21:59,247 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1467) no Hoare annotation was computed. [2022-11-03 02:21:59,247 INFO L895 garLoopResultBuilder]: At program point L1757(lines 1757 1824) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= 2 ~s~0)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~s~0 ~UNLOADED~0) (= ~customIrp~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1))) [2022-11-03 02:21:59,247 INFO L899 garLoopResultBuilder]: For program point L1757-1(lines 1727 1878) no Hoare annotation was computed. [2022-11-03 02:21:59,247 INFO L895 garLoopResultBuilder]: At program point L634(lines 633 851) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,248 INFO L895 garLoopResultBuilder]: At program point L172-2(lines 172 189) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,248 INFO L895 garLoopResultBuilder]: At program point L1692(line 1692) the Hoare annotation is: false [2022-11-03 02:21:59,248 INFO L899 garLoopResultBuilder]: For program point L1692-1(lines 1688 1694) no Hoare annotation was computed. [2022-11-03 02:21:59,248 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,248 INFO L899 garLoopResultBuilder]: For program point L1626-1(line 1626) no Hoare annotation was computed. [2022-11-03 02:21:59,248 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 307) no Hoare annotation was computed. [2022-11-03 02:21:59,249 INFO L899 garLoopResultBuilder]: For program point L173(lines 172 189) no Hoare annotation was computed. [2022-11-03 02:21:59,249 INFO L895 garLoopResultBuilder]: At program point L570(lines 570 865) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,249 INFO L895 garLoopResultBuilder]: At program point L1495(line 1495) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse10 (= ~compRegistered~0 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:21:59,249 INFO L899 garLoopResultBuilder]: For program point L1495-1(line 1495) no Hoare annotation was computed. [2022-11-03 02:21:59,249 INFO L899 garLoopResultBuilder]: For program point L1429(line 1429) no Hoare annotation was computed. [2022-11-03 02:21:59,250 INFO L895 garLoopResultBuilder]: At program point L1297(lines 1297 1298) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,250 INFO L899 garLoopResultBuilder]: For program point L1297-1(lines 1297 1298) no Hoare annotation was computed. [2022-11-03 02:21:59,250 INFO L895 garLoopResultBuilder]: At program point L240(lines 239 307) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,250 INFO L899 garLoopResultBuilder]: For program point L1231(lines 1231 1234) no Hoare annotation was computed. [2022-11-03 02:21:59,250 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1481) no Hoare annotation was computed. [2022-11-03 02:21:59,251 INFO L899 garLoopResultBuilder]: For program point L1826(lines 1826 1830) no Hoare annotation was computed. [2022-11-03 02:21:59,251 INFO L895 garLoopResultBuilder]: At program point L703(line 703) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) [2022-11-03 02:21:59,251 INFO L899 garLoopResultBuilder]: For program point L703-1(line 703) no Hoare annotation was computed. [2022-11-03 02:21:59,251 INFO L895 garLoopResultBuilder]: At program point L1034(lines 1024 1483) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,252 INFO L895 garLoopResultBuilder]: At program point L1497(lines 894 1499) the Hoare annotation is: (let ((.cse3 (= ~customIrp~0 0)) (.cse10 (= ~s~0 ~DC~0)) (.cse11 (= 2 ~s~0)) (.cse12 (not (= ~IPC~0 2))) (.cse0 (= ~routine~0 0)) (.cse1 (<= 3 ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (<= 4 ~SKIP2~0)) (.cse8 (= ~pended~0 0)) (.cse9 (= ~compRegistered~0 0))) (or (and (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| ~lowerDriverReturn~0) (<= 7 ~IPC~0) (= 2 ~DC~0) .cse0 .cse1 (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (or (let ((.cse7 (+ ~myStatus~0 1073741637))) (and (<= .cse7 0) (<= 0 .cse7))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) .cse8 .cse9 (= ~SKIP2~0 ~s~0)) (and .cse10 .cse11 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse12 .cse0 .cse1 .cse2 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) .cse4 .cse5 .cse6 .cse8 .cse9) (and (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse10 .cse11 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse10 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse11 .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0) .cse6 .cse8 .cse9))) [2022-11-03 02:21:59,252 INFO L899 garLoopResultBuilder]: For program point L1431(lines 1431 1452) no Hoare annotation was computed. [2022-11-03 02:21:59,252 INFO L895 garLoopResultBuilder]: At program point L242(lines 241 307) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,252 INFO L895 garLoopResultBuilder]: At program point L176(lines 176 184) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,253 INFO L895 garLoopResultBuilder]: At program point L309(lines 218 311) the Hoare annotation is: (let ((.cse7 (= ~compRegistered~0 1)) (.cse8 (<= 7 ~IPC~0)) (.cse0 (= 2 ~DC~0)) (.cse9 (= 2 ~s~0)) (.cse1 (<= 3 ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~customIrp~0 0)) (.cse3 (= ~NP~0 1)) (.cse4 (not (= ~MPR3~0 1))) (.cse11 (= ~routine~0 1)) (.cse5 (<= 4 ~SKIP2~0)) (.cse6 (= ~pended~0 0))) (or (and .cse0 (not (= ~IPC~0 2)) (= ~routine~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~compRegistered~0 0) (= |ULTIMATE.start_CdAudioPnp_#res#1| ~lowerDriverReturn~0) (= ~SKIP2~0 ~s~0)) (and .cse7 .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse4 .cse11 .cse5 (<= ~myStatus~0 0) .cse6 (<= |ULTIMATE.start_CdAudioPnp_#res#1| 0)) (and .cse7 .cse8 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse0 .cse9 (= |ULTIMATE.start_CdAudioPnp_#res#1| 0) .cse1 (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse7 (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudioPnp_#res#1| 1) 0) .cse8 .cse0 .cse9 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6))) [2022-11-03 02:21:59,253 INFO L895 garLoopResultBuilder]: At program point L772(lines 772 773) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,253 INFO L899 garLoopResultBuilder]: For program point L772-1(lines 772 773) no Hoare annotation was computed. [2022-11-03 02:21:59,253 INFO L899 garLoopResultBuilder]: For program point L640(line 640) no Hoare annotation was computed. [2022-11-03 02:21:59,254 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,254 INFO L899 garLoopResultBuilder]: For program point L1631-1(line 1631) no Hoare annotation was computed. [2022-11-03 02:21:59,254 INFO L899 garLoopResultBuilder]: For program point L1301(lines 1301 1313) no Hoare annotation was computed. [2022-11-03 02:21:59,254 INFO L899 garLoopResultBuilder]: For program point L1368(lines 1368 1382) no Hoare annotation was computed. [2022-11-03 02:21:59,254 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 181) no Hoare annotation was computed. [2022-11-03 02:21:59,254 INFO L895 garLoopResultBuilder]: At program point L1170(line 1170) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,254 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-11-03 02:21:59,255 INFO L895 garLoopResultBuilder]: At program point L2095(lines 2051 2126) the Hoare annotation is: (and (= 2 ~DC~0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,255 INFO L899 garLoopResultBuilder]: For program point L840(line 840) no Hoare annotation was computed. [2022-11-03 02:21:59,255 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2022-11-03 02:21:59,255 INFO L895 garLoopResultBuilder]: At program point L1633(lines 1590 1638) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= 3 ~SKIP1~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~customIrp~0 0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 (not (= ~IPC~0 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) (and (= ~compRegistered~0 1) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8))) [2022-11-03 02:21:59,255 INFO L899 garLoopResultBuilder]: For program point L1105(lines 1105 1465) no Hoare annotation was computed. [2022-11-03 02:21:59,256 INFO L895 garLoopResultBuilder]: At program point L1832(lines 1825 1876) the Hoare annotation is: (let ((.cse21 (= ~compRegistered~0 0)) (.cse0 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse23 (= ~s~0 ~DC~0)) (.cse19 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse11 (<= 4 ~SKIP2~0)) (.cse20 (= ~pended~0 0))) (let ((.cse12 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741670) 0)) (.cse14 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1073741670) 0)) (.cse16 (= |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 0)) (.cse18 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1) 0)) (.cse17 (<= (+ |ULTIMATE.start_main_~status~9#1| 1) 0)) (.cse3 (= ~routine~0 0)) (.cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|)) (.cse10 (= |ULTIMATE.start_main_~status~9#1| ~lowerDriverReturn~0)) (.cse22 (= ~SKIP2~0 ~s~0)) (.cse1 (<= 7 ~IPC~0)) (.cse15 (= |ULTIMATE.start_main_~status~9#1| 0)) (.cse13 (or (and .cse2 .cse23 .cse19 .cse4 .cse5 .cse8 .cse9 .cse11 .cse20 .cse21) (and .cse0 .cse2 .cse23 .cse19 .cse4 .cse5 .cse8 .cse9 .cse11 .cse20))) (.cse7 (= ~customIrp~0 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~IPC~0 ~s~0) .cse10 .cse11) (and .cse12 .cse13 .cse14 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse1 .cse15 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) .cse13 (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse16 .cse7) (and .cse12 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse13 .cse14 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0)) (and .cse17 .cse13 .cse18 .cse7 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0)) (and .cse15 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse13 .cse16 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0)) (and .cse2 .cse19 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 (= |ULTIMATE.start_CdAudioPnp_#res#1| ~lowerDriverReturn~0) .cse22) (and .cse2 .cse23 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|) 0) .cse19 .cse4 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse5 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741789) 0) .cse8 .cse9 .cse11 .cse20) (and (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse17 .cse13 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse18 .cse7) (and (< |ULTIMATE.start_main_~status~9#1| (+ ~lowerDriverReturn~0 1)) .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~9#1|) .cse4 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse5 .cse8 .cse9 .cse11 .cse20 .cse22 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (= ~s~0 ~UNLOADED~0) (and .cse17 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse13 .cse18 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0)) (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudioPnp_#res#1| 1) 0) .cse1 .cse17 .cse13 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse7) (and .cse1 (<= |ULTIMATE.start_main_~status~9#1| 0) .cse13 .cse7 (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (<= ~myStatus~0 0) (<= |ULTIMATE.start_CdAudioPnp_#res#1| 0)) (and .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22) (and .cse1 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse15 .cse13 (= |ULTIMATE.start_CdAudioPnp_#res#1| 0) (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse7)))) [2022-11-03 02:21:59,256 INFO L895 garLoopResultBuilder]: At program point L1238(line 1238) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,257 INFO L899 garLoopResultBuilder]: For program point L1238-1(line 1238) no Hoare annotation was computed. [2022-11-03 02:21:59,257 INFO L895 garLoopResultBuilder]: At program point L1106(lines 1087 1469) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,257 INFO L895 garLoopResultBuilder]: At program point L842(lines 635 851) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,257 INFO L895 garLoopResultBuilder]: At program point L710(line 710) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,258 INFO L899 garLoopResultBuilder]: For program point L710-1(line 710) no Hoare annotation was computed. [2022-11-03 02:21:59,258 INFO L899 garLoopResultBuilder]: For program point L1834(lines 1834 1838) no Hoare annotation was computed. [2022-11-03 02:21:59,258 INFO L895 garLoopResultBuilder]: At program point L579(lines 579 863) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,258 INFO L895 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 ~routine~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~customIrp~0 0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1))) (.cse9 (= ~routine~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (= ~pended~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-11-03 02:21:59,258 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-11-03 02:21:59,259 INFO L895 garLoopResultBuilder]: At program point L1042(lines 1042 1479) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,259 INFO L899 garLoopResultBuilder]: For program point L844(line 844) no Hoare annotation was computed. [2022-11-03 02:21:59,259 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 733) no Hoare annotation was computed. [2022-11-03 02:21:59,259 INFO L899 garLoopResultBuilder]: For program point L712-1(lines 712 733) no Hoare annotation was computed. [2022-11-03 02:21:59,259 INFO L899 garLoopResultBuilder]: For program point L647(lines 647 651) no Hoare annotation was computed. [2022-11-03 02:21:59,259 INFO L895 garLoopResultBuilder]: At program point L317(lines 317 362) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,260 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2022-11-03 02:21:59,260 INFO L895 garLoopResultBuilder]: At program point L1310(line 1310) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,260 INFO L899 garLoopResultBuilder]: For program point L1310-1(line 1310) no Hoare annotation was computed. [2022-11-03 02:21:59,260 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-11-03 02:21:59,260 INFO L899 garLoopResultBuilder]: For program point L2103(lines 2103 2123) no Hoare annotation was computed. [2022-11-03 02:21:59,261 INFO L895 garLoopResultBuilder]: At program point L1443(line 1443) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,261 INFO L899 garLoopResultBuilder]: For program point L1443-1(line 1443) no Hoare annotation was computed. [2022-11-03 02:21:59,261 INFO L895 garLoopResultBuilder]: At program point L320(lines 320 361) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,261 INFO L895 garLoopResultBuilder]: At program point L849(lines 637 850) the Hoare annotation is: (let ((.cse0 (<= 7 ~IPC~0)) (.cse7 (= ~customIrp~0 0)) (.cse11 (or (let ((.cse14 (+ ~myStatus~0 1073741637))) (and (<= .cse14 0) (<= 0 .cse14))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0)))) (.cse1 (= 2 ~DC~0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse10 (<= 4 ~SKIP2~0)) (.cse12 (= ~pended~0 0)) (.cse13 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) .cse10 .cse11 .cse12 .cse13) (and (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741789) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13))) [2022-11-03 02:21:59,262 INFO L895 garLoopResultBuilder]: At program point L1840(lines 1833 1875) the Hoare annotation is: (let ((.cse12 (= ~compRegistered~0 1)) (.cse22 (= ~s~0 ~DC~0)) (.cse23 (= 2 ~s~0)) (.cse1 (not (= ~IPC~0 2))) (.cse3 (<= 3 ~SKIP1~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~compRegistered~0 0))) (let ((.cse5 (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|)) (.cse0 (= 2 ~DC~0)) (.cse2 (= ~routine~0 0)) (.cse8 (= |ULTIMATE.start_main_~status~9#1| ~lowerDriverReturn~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse19 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741670) 0)) (.cse20 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1073741670) 0)) (.cse17 (<= (+ |ULTIMATE.start_main_~status~9#1| 1) 0)) (.cse18 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1) 0)) (.cse13 (<= 7 ~IPC~0)) (.cse14 (= ~customIrp~0 0)) (.cse16 (= |ULTIMATE.start_main_~status~9#1| 0)) (.cse15 (or (and .cse12 .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse7 .cse9) (and .cse22 .cse23 .cse1 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10))) (.cse21 (= |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (< |ULTIMATE.start_main_~status~9#1| (+ ~lowerDriverReturn~0 1)) .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~9#1|) .cse3 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse4 .cse6 .cse7 .cse9 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse12 .cse13 .cse0 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse8 .cse9) (and .cse13 (<= |ULTIMATE.start_main_~status~9#1| 0) .cse15 .cse14 (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (<= ~myStatus~0 0) (<= |ULTIMATE.start_CdAudioPnp_#res#1| 0)) (and .cse13 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse16 .cse15 (= |ULTIMATE.start_CdAudioPnp_#res#1| 0) (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse14) (and .cse17 .cse15 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse18 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0)) (and .cse17 .cse15 .cse18 .cse14 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_CdAudioPnp_#res#1| ~lowerDriverReturn~0) .cse11) (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudioPnp_#res#1| 1) 0) .cse13 .cse17 .cse15 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse14) (and .cse19 .cse15 .cse20 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse19 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse15 .cse20 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0)) (and (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse17 .cse15 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse18 .cse14) (and .cse13 .cse16 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) .cse15 (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse21 .cse14) (= ~s~0 ~UNLOADED~0) (and .cse22 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741789) 0) .cse23 (<= (+ 1073741789 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|) 0) .cse1 .cse3 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse4 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741789) 0) .cse6 .cse7 .cse9) (and .cse16 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse15 .cse21 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0))))) [2022-11-03 02:21:59,262 INFO L895 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,262 INFO L899 garLoopResultBuilder]: For program point L1246(lines 1246 1249) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L255-1(line 255) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L1114(lines 1114 1463) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L1841(lines 1825 1876) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 787) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L1775(lines 1775 1777) no Hoare annotation was computed. [2022-11-03 02:21:59,263 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 659) no Hoare annotation was computed. [2022-11-03 02:21:59,264 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,264 INFO L899 garLoopResultBuilder]: For program point L1379-1(line 1379) no Hoare annotation was computed. [2022-11-03 02:21:59,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:21:59,264 INFO L895 garLoopResultBuilder]: At program point L190(lines 162 200) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,264 INFO L895 garLoopResultBuilder]: At program point L1115(lines 1114 1463) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,265 INFO L899 garLoopResultBuilder]: For program point L1842(lines 1842 1873) no Hoare annotation was computed. [2022-11-03 02:21:59,265 INFO L895 garLoopResultBuilder]: At program point L323(lines 323 360) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,265 INFO L899 garLoopResultBuilder]: For program point L1843(lines 1843 1872) no Hoare annotation was computed. [2022-11-03 02:21:59,265 INFO L895 garLoopResultBuilder]: At program point L588(lines 588 861) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,266 INFO L895 garLoopResultBuilder]: At program point L1117(lines 1116 1463) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,266 INFO L895 garLoopResultBuilder]: At program point L1051(lines 1051 1477) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,266 INFO L899 garLoopResultBuilder]: For program point L1844(lines 1844 1854) no Hoare annotation was computed. [2022-11-03 02:21:59,266 INFO L899 garLoopResultBuilder]: For program point L1845(lines 1845 1851) no Hoare annotation was computed. [2022-11-03 02:21:59,266 INFO L895 garLoopResultBuilder]: At program point L722(lines 712 733) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,267 INFO L895 garLoopResultBuilder]: At program point L656(line 656) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) [2022-11-03 02:21:59,267 INFO L899 garLoopResultBuilder]: For program point L656-1(line 656) no Hoare annotation was computed. [2022-11-03 02:21:59,267 INFO L895 garLoopResultBuilder]: At program point L1449(line 1449) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,267 INFO L899 garLoopResultBuilder]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2022-11-03 02:21:59,267 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1397) no Hoare annotation was computed. [2022-11-03 02:21:59,268 INFO L895 garLoopResultBuilder]: At program point L326(lines 326 359) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,268 INFO L895 garLoopResultBuilder]: At program point L260(lines 260 261) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,268 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 260 261) no Hoare annotation was computed. [2022-11-03 02:21:59,268 INFO L895 garLoopResultBuilder]: At program point L1318(line 1318) the Hoare annotation is: false [2022-11-03 02:21:59,268 INFO L899 garLoopResultBuilder]: For program point L1318-1(line 1318) no Hoare annotation was computed. [2022-11-03 02:21:59,269 INFO L895 garLoopResultBuilder]: At program point L1847(line 1847) the Hoare annotation is: false [2022-11-03 02:21:59,269 INFO L895 garLoopResultBuilder]: At program point L1781(lines 1781 1818) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,269 INFO L895 garLoopResultBuilder]: At program point L1253(line 1253) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,269 INFO L899 garLoopResultBuilder]: For program point L1253-1(line 1253) no Hoare annotation was computed. [2022-11-03 02:21:59,269 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 731) no Hoare annotation was computed. [2022-11-03 02:21:59,270 INFO L899 garLoopResultBuilder]: For program point L1321(lines 1321 1333) no Hoare annotation was computed. [2022-11-03 02:21:59,270 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 274) no Hoare annotation was computed. [2022-11-03 02:21:59,270 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 267) no Hoare annotation was computed. [2022-11-03 02:21:59,270 INFO L899 garLoopResultBuilder]: For program point L2115(lines 2115 2122) no Hoare annotation was computed. [2022-11-03 02:21:59,270 INFO L895 garLoopResultBuilder]: At program point L728(line 728) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,270 INFO L899 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-11-03 02:21:59,271 INFO L895 garLoopResultBuilder]: At program point L1786(lines 1786 1817) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,271 INFO L895 garLoopResultBuilder]: At program point L597(lines 597 859) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,271 INFO L899 garLoopResultBuilder]: For program point L1456(line 1456) no Hoare annotation was computed. [2022-11-03 02:21:59,271 INFO L895 garLoopResultBuilder]: At program point L1126(line 1126) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,271 INFO L899 garLoopResultBuilder]: For program point L1126-1(line 1126) no Hoare annotation was computed. [2022-11-03 02:21:59,272 INFO L895 garLoopResultBuilder]: At program point L1060(lines 1060 1475) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,272 INFO L895 garLoopResultBuilder]: At program point L664(lines 664 665) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,272 INFO L899 garLoopResultBuilder]: For program point L664-1(lines 664 665) no Hoare annotation was computed. [2022-11-03 02:21:59,272 INFO L899 garLoopResultBuilder]: For program point L2052(lines 2052 2072) no Hoare annotation was computed. [2022-11-03 02:21:59,272 INFO L895 garLoopResultBuilder]: At program point L2052-1(lines 2052 2072) the Hoare annotation is: (and (= 2 ~DC~0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,273 INFO L895 garLoopResultBuilder]: At program point L269(lines 264 274) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,273 INFO L899 garLoopResultBuilder]: For program point L1128(lines 1128 1132) no Hoare annotation was computed. [2022-11-03 02:21:59,273 INFO L899 garLoopResultBuilder]: For program point L2053(lines 2053 2063) no Hoare annotation was computed. [2022-11-03 02:21:59,273 INFO L895 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,273 INFO L899 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-11-03 02:21:59,273 INFO L899 garLoopResultBuilder]: For program point L1525(lines 1525 1548) no Hoare annotation was computed. [2022-11-03 02:21:59,274 INFO L895 garLoopResultBuilder]: At program point L270-1(lines 264 274) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,274 INFO L895 garLoopResultBuilder]: At program point L2120(line 2120) the Hoare annotation is: false [2022-11-03 02:21:59,274 INFO L895 garLoopResultBuilder]: At program point L2120-1(lines 2099 2124) the Hoare annotation is: (and (= 2 ~DC~0) (<= 3 ~SKIP1~0) (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) [2022-11-03 02:21:59,275 INFO L895 garLoopResultBuilder]: At program point L1856(lines 1843 1872) the Hoare annotation is: (let ((.cse22 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse20 (= ~s~0 ~DC~0)) (.cse21 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0)) (.cse24 (= ~compRegistered~0 0))) (let ((.cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|)) (.cse1 (= |ULTIMATE.start_main_~status~9#1| ~lowerDriverReturn~0)) (.cse10 (or (and .cse22 .cse2 .cse20 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse20 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24))) (.cse17 (= ~customIrp~0 0)) (.cse3 (not (= 2 ~s~0))) (.cse23 (= ~routine~0 0))) (let ((.cse0 (or (and .cse2 .cse3 .cse21 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24) (and .cse22 .cse2 .cse3 .cse21 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8))) (.cse14 (<= (+ |ULTIMATE.start_main_~status~9#1| 1) 0)) (.cse16 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1) 0)) (.cse18 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741670) 0)) (.cse19 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1073741670) 0)) (.cse11 (= |ULTIMATE.start_main_~status~9#1| 0)) (.cse12 (= |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 0)) (.cse13 (<= 7 ~IPC~0)) (.cse15 (or (and .cse22 .cse2 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0) .cse23 .cse4 .cse5 .cse9 .cse17 .cse6 .cse7 (= ~IPC~0 ~s~0) .cse1 .cse8) (and .cse10 .cse17)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_CdAudioPnp_#res#1| ~lowerDriverReturn~0)) (and (< |ULTIMATE.start_main_~status~9#1| (+ ~lowerDriverReturn~0 1)) .cse2 .cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~9#1|) .cse4 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse5 .cse6 .cse7 .cse8 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse0 .cse9 .cse1) (and .cse10 .cse11 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse12 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0)) (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudioPnp_#res#1| 1) 0) .cse13 .cse14 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse15) (and .cse10 .cse14 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse16 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0)) (and .cse10 .cse14 .cse16 .cse17 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0)) (and .cse10 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse14 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse16 .cse17) (and .cse10 .cse18 .cse19 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse10 .cse18 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse19 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0)) (and .cse2 .cse20 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|) 0) .cse21 .cse4 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse5 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741789) 0) .cse6 .cse7 .cse8) (and .cse13 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse11 (= |ULTIMATE.start_CdAudioPnp_#res#1| 0) (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse15) (and .cse13 .cse11 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse12 .cse15) (and .cse13 (<= |ULTIMATE.start_main_~status~9#1| 0) (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (<= ~myStatus~0 0) .cse15 (<= |ULTIMATE.start_CdAudioPnp_#res#1| 0)))))) [2022-11-03 02:21:59,275 INFO L895 garLoopResultBuilder]: At program point L1394(line 1394) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,275 INFO L899 garLoopResultBuilder]: For program point L1394-1(line 1394) no Hoare annotation was computed. [2022-11-03 02:21:59,275 INFO L895 garLoopResultBuilder]: At program point L2055(line 2055) the Hoare annotation is: false [2022-11-03 02:21:59,276 INFO L899 garLoopResultBuilder]: For program point L2055-1(line 2055) no Hoare annotation was computed. [2022-11-03 02:21:59,276 INFO L895 garLoopResultBuilder]: At program point L1791(lines 1791 1816) the Hoare annotation is: (and (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,276 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 676) no Hoare annotation was computed. [2022-11-03 02:21:59,276 INFO L895 garLoopResultBuilder]: At program point L1461(lines 1118 1462) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse10 (= ~compRegistered~0 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~customIrp~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:21:59,276 INFO L899 garLoopResultBuilder]: For program point L1858(lines 1858 1870) no Hoare annotation was computed. [2022-11-03 02:21:59,277 INFO L895 garLoopResultBuilder]: At program point L1330(line 1330) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,277 INFO L899 garLoopResultBuilder]: For program point L1330-1(line 1330) no Hoare annotation was computed. [2022-11-03 02:21:59,277 INFO L899 garLoopResultBuilder]: For program point L1859(lines 1859 1863) no Hoare annotation was computed. [2022-11-03 02:21:59,277 INFO L899 garLoopResultBuilder]: For program point L1133(lines 1133 1147) no Hoare annotation was computed. [2022-11-03 02:21:59,277 INFO L899 garLoopResultBuilder]: For program point L2058(lines 2058 2062) no Hoare annotation was computed. [2022-11-03 02:21:59,277 INFO L899 garLoopResultBuilder]: For program point L2058-2(lines 2053 2063) no Hoare annotation was computed. [2022-11-03 02:21:59,278 INFO L895 garLoopResultBuilder]: At program point L671(line 671) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,278 INFO L899 garLoopResultBuilder]: For program point L671-1(line 671) no Hoare annotation was computed. [2022-11-03 02:21:59,278 INFO L899 garLoopResultBuilder]: For program point L1266(lines 1266 1279) no Hoare annotation was computed. [2022-11-03 02:21:59,278 INFO L895 garLoopResultBuilder]: At program point L1861(line 1861) the Hoare annotation is: false [2022-11-03 02:21:59,278 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 857) no Hoare annotation was computed. [2022-11-03 02:21:59,278 INFO L895 garLoopResultBuilder]: At program point L1531(line 1531) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,278 INFO L899 garLoopResultBuilder]: For program point L1531-1(line 1531) no Hoare annotation was computed. [2022-11-03 02:21:59,279 INFO L899 garLoopResultBuilder]: For program point L276(line 276) no Hoare annotation was computed. [2022-11-03 02:21:59,279 INFO L899 garLoopResultBuilder]: For program point L1069(lines 1069 1473) no Hoare annotation was computed. [2022-11-03 02:21:59,279 INFO L895 garLoopResultBuilder]: At program point L2060(line 2060) the Hoare annotation is: false [2022-11-03 02:21:59,279 INFO L899 garLoopResultBuilder]: For program point L2060-1(line 2060) no Hoare annotation was computed. [2022-11-03 02:21:59,279 INFO L895 garLoopResultBuilder]: At program point L1070(lines 1069 1473) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,279 INFO L899 garLoopResultBuilder]: For program point L872(line 872) no Hoare annotation was computed. [2022-11-03 02:21:59,280 INFO L895 garLoopResultBuilder]: At program point L1401(lines 1401 1402) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,280 INFO L899 garLoopResultBuilder]: For program point L1401-1(lines 1401 1402) no Hoare annotation was computed. [2022-11-03 02:21:59,280 INFO L899 garLoopResultBuilder]: For program point L1534(lines 1534 1541) no Hoare annotation was computed. [2022-11-03 02:21:59,280 INFO L895 garLoopResultBuilder]: At program point L874(lines 433 876) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~DC~0)) (.cse1 (= 2 ~s~0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~customIrp~0 0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1))) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse11 (= ~compRegistered~0 0))) (or (and (<= 7 ~IPC~0) .cse0 .cse1 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudio535DeviceControl_#res#1|) (= 2 ~DC~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) .cse10 .cse11 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) .cse8 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) .cse9 .cse10 .cse11))) [2022-11-03 02:21:59,281 INFO L899 garLoopResultBuilder]: For program point L1865(lines 1865 1869) no Hoare annotation was computed. [2022-11-03 02:21:59,281 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 812) no Hoare annotation was computed. [2022-11-03 02:21:59,281 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1351) no Hoare annotation was computed. [2022-11-03 02:21:59,281 INFO L895 garLoopResultBuilder]: At program point L215(lines 141 217) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0)) (.cse1 (= ~compRegistered~0 ~routine~0)) (.cse2 (<= 7 ~IPC~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~customIrp~0 0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse10 (= ~routine~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse12 (or (let ((.cse14 (+ ~myStatus~0 1073741637))) (and (<= .cse14 0) (<= 0 .cse14))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0)))) (.cse13 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-03 02:21:59,281 INFO L895 garLoopResultBuilder]: At program point L1206(line 1206) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,281 INFO L899 garLoopResultBuilder]: For program point L1206-1(line 1206) no Hoare annotation was computed. [2022-11-03 02:21:59,282 INFO L895 garLoopResultBuilder]: At program point L1867(line 1867) the Hoare annotation is: false [2022-11-03 02:21:59,282 INFO L899 garLoopResultBuilder]: For program point L2066(lines 2066 2070) no Hoare annotation was computed. [2022-11-03 02:21:59,282 INFO L895 garLoopResultBuilder]: At program point L1538(line 1538) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,282 INFO L899 garLoopResultBuilder]: For program point L1538-1(line 1538) no Hoare annotation was computed. [2022-11-03 02:21:59,282 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 02:21:59,282 INFO L895 garLoopResultBuilder]: At program point L2068(line 2068) the Hoare annotation is: false [2022-11-03 02:21:59,283 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 855) no Hoare annotation was computed. [2022-11-03 02:21:59,283 INFO L895 garLoopResultBuilder]: At program point L1276(line 1276) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,283 INFO L899 garLoopResultBuilder]: For program point L1276-1(line 1276) no Hoare annotation was computed. [2022-11-03 02:21:59,283 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (and (= 2 ~DC~0) (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,283 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-11-03 02:21:59,284 INFO L895 garLoopResultBuilder]: At program point L1078(lines 1078 1471) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,284 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 752) no Hoare annotation was computed. [2022-11-03 02:21:59,284 INFO L895 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,284 INFO L899 garLoopResultBuilder]: For program point L155-1(line 155) no Hoare annotation was computed. [2022-11-03 02:21:59,284 INFO L895 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,285 INFO L899 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-11-03 02:21:59,285 INFO L899 garLoopResultBuilder]: For program point L1609(lines 1609 1634) no Hoare annotation was computed. [2022-11-03 02:21:59,285 INFO L895 garLoopResultBuilder]: At program point L354(line 354) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,285 INFO L899 garLoopResultBuilder]: For program point L354-1(line 354) no Hoare annotation was computed. [2022-11-03 02:21:59,285 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 278 292) the Hoare annotation is: (and (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,286 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1485) no Hoare annotation was computed. [2022-11-03 02:21:59,286 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1623) no Hoare annotation was computed. [2022-11-03 02:21:59,286 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1293) no Hoare annotation was computed. [2022-11-03 02:21:59,286 INFO L895 garLoopResultBuilder]: At program point L1016(lines 1015 1485) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,286 INFO L899 garLoopResultBuilder]: For program point L554(lines 554 869) no Hoare annotation was computed. [2022-11-03 02:21:59,286 INFO L895 garLoopResultBuilder]: At program point L1545(line 1545) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,287 INFO L899 garLoopResultBuilder]: For program point L1545-1(line 1545) no Hoare annotation was computed. [2022-11-03 02:21:59,287 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 160) no Hoare annotation was computed. [2022-11-03 02:21:59,287 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 760) no Hoare annotation was computed. [2022-11-03 02:21:59,287 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-11-03 02:21:59,287 INFO L895 garLoopResultBuilder]: At program point L555(lines 554 869) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,288 INFO L895 garLoopResultBuilder]: At program point L357(lines 330 358) the Hoare annotation is: (let ((.cse12 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1073741670) 0)) (.cse15 (= |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 0)) (.cse0 (= ~s~0 ~DC~0)) (.cse1 (= 2 ~s~0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1) 0)) (.cse10 (= ~pended~0 0)) (.cse11 (= ~compRegistered~0 0)) (.cse14 (<= 7 ~IPC~0)) (.cse16 (= 2 ~DC~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse17 (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|)) (.cse13 (= ~customIrp~0 0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1))) (.cse9 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0) .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 (<= (+ 1073741789 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|) 0) .cse2 .cse4 .cse5 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse6 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741789) 0) .cse7 .cse8 .cse9 .cse10) (and (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse0 .cse1 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse0 .cse1 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse2 .cse4 .cse5 .cse6 .cse15 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) .cse10 .cse11 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse0 .cse1 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse2 .cse4 .cse5 .cse6 .cse15 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse16 .cse2 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) .cse8 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0) .cse9 .cse10 .cse11) (and (= ~compRegistered~0 1) .cse14 .cse16 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0) .cse4 .cse5 .cse6 .cse17 .cse13 .cse7 .cse8 (= ~IPC~0 ~s~0) .cse9))) [2022-11-03 02:21:59,288 INFO L895 garLoopResultBuilder]: At program point L1348(line 1348) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,288 INFO L899 garLoopResultBuilder]: For program point L1348-1(line 1348) no Hoare annotation was computed. [2022-11-03 02:21:59,288 INFO L902 garLoopResultBuilder]: At program point L1877(lines 1717 1879) the Hoare annotation is: true [2022-11-03 02:21:59,288 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1229) no Hoare annotation was computed. [2022-11-03 02:21:59,289 INFO L895 garLoopResultBuilder]: At program point L1151(lines 1151 1152) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:21:59,289 INFO L899 garLoopResultBuilder]: For program point L1151-1(lines 1151 1152) no Hoare annotation was computed. [2022-11-03 02:21:59,289 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 853) no Hoare annotation was computed. [2022-11-03 02:21:59,289 INFO L899 garLoopResultBuilder]: For program point L1615(lines 1615 1622) no Hoare annotation was computed. [2022-11-03 02:21:59,289 INFO L899 garLoopResultBuilder]: For program point L1615-1(lines 1610 1623) no Hoare annotation was computed. [2022-11-03 02:21:59,289 INFO L899 garLoopResultBuilder]: For program point L294(line 294) no Hoare annotation was computed. [2022-11-03 02:21:59,290 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 200) no Hoare annotation was computed. [2022-11-03 02:21:59,290 INFO L895 garLoopResultBuilder]: At program point L162-2(lines 162 200) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (<= (+ |ULTIMATE.start_CdAudioStartDevice_~status~1#1| 1) 0)) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0)) [2022-11-03 02:21:59,290 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 1469) no Hoare annotation was computed. [2022-11-03 02:21:59,291 INFO L895 garLoopResultBuilder]: At program point L1814(lines 1757 1824) the Hoare annotation is: (let ((.cse21 (= ~compRegistered~0 0)) (.cse0 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse23 (= ~s~0 ~DC~0)) (.cse19 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse11 (<= 4 ~SKIP2~0)) (.cse20 (= ~pended~0 0))) (let ((.cse12 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741670) 0)) (.cse14 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1073741670) 0)) (.cse16 (= |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 0)) (.cse18 (<= (+ |ULTIMATE.start_CdAudioDeviceControl_~status~3#1| 1) 0)) (.cse17 (<= (+ |ULTIMATE.start_main_~status~9#1| 1) 0)) (.cse3 (= ~routine~0 0)) (.cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|)) (.cse10 (= |ULTIMATE.start_main_~status~9#1| ~lowerDriverReturn~0)) (.cse22 (= ~SKIP2~0 ~s~0)) (.cse1 (<= 7 ~IPC~0)) (.cse15 (= |ULTIMATE.start_main_~status~9#1| 0)) (.cse13 (or (and .cse2 .cse23 .cse19 .cse4 .cse5 .cse8 .cse9 .cse11 .cse20 .cse21) (and .cse0 .cse2 .cse23 .cse19 .cse4 .cse5 .cse8 .cse9 .cse11 .cse20))) (.cse7 (= ~customIrp~0 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_CdAudioHPCdrDeviceControl_#res#1| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~IPC~0 ~s~0) .cse10 .cse11) (and .cse12 .cse13 .cse14 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1073741670) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) (and .cse1 .cse15 (= |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 0) .cse13 (= |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 0) .cse16 .cse7) (and .cse12 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1073741670) 0) .cse13 .cse14 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741670) 0)) (and .cse17 .cse13 .cse18 .cse7 (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_#res#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1) 0)) (and .cse15 (= |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 0) .cse13 .cse16 (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0)) (and .cse2 .cse19 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 (= |ULTIMATE.start_CdAudioPnp_#res#1| ~lowerDriverReturn~0) .cse22) (and .cse2 .cse23 (<= (+ |ULTIMATE.start_main_~status~9#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_CdAudioDeviceControl_~status~3#1|) 0) .cse19 .cse4 (<= (+ 1073741789 |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1|) 0) .cse5 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1073741789) 0) .cse8 .cse9 .cse11 .cse20) (and (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_#res#1| 1) 0) .cse17 .cse13 (<= (+ |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 1) 0) .cse18 .cse7) (and (< |ULTIMATE.start_main_~status~9#1| (+ ~lowerDriverReturn~0 1)) .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~9#1|) .cse4 (<= |ULTIMATE.start_PoCallDriver_~returnVal~0#1| ~lowerDriverReturn~0) .cse5 .cse8 .cse9 .cse11 .cse20 .cse22 (<= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|)) (and .cse17 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_~status~7#1| 1) 0) .cse13 .cse18 (<= (+ |ULTIMATE.start_CdAudioAtapiDeviceControl_#res#1| 1) 0)) (and (<= (+ |ULTIMATE.start_CdAudioPnp_~status~2#1| 1) 0) (<= (+ |ULTIMATE.start_CdAudioPnp_#res#1| 1) 0) .cse1 .cse17 .cse13 (<= (+ |ULTIMATE.start_CdAudioStartDevice_#res#1| 1) 0) .cse7) (and .cse1 (<= |ULTIMATE.start_main_~status~9#1| 0) .cse13 .cse7 (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (<= ~myStatus~0 0) (<= |ULTIMATE.start_CdAudioPnp_#res#1| 0)) (and .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 .cse22) (and .cse1 (= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) .cse15 .cse13 (= |ULTIMATE.start_CdAudioPnp_#res#1| 0) (= |ULTIMATE.start_CdAudioStartDevice_#res#1| 0) .cse7)))) [2022-11-03 02:21:59,291 INFO L895 garLoopResultBuilder]: At program point L757(line 757) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ |ULTIMATE.start_CdAudio535DeviceControl_~status~5#1| 1073741670) 0)) [2022-11-03 02:21:59,291 INFO L899 garLoopResultBuilder]: For program point L757-1(line 757) no Hoare annotation was computed. [2022-11-03 02:21:59,291 INFO L895 garLoopResultBuilder]: At program point L625(lines 606 857) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,292 INFO L895 garLoopResultBuilder]: At program point L1418(line 1418) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,292 INFO L899 garLoopResultBuilder]: For program point L1418-1(line 1418) no Hoare annotation was computed. [2022-11-03 02:21:59,292 INFO L895 garLoopResultBuilder]: At program point L295(line 295) the Hoare annotation is: (and (= ~compRegistered~0 ~routine~0) (<= 7 ~IPC~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (or (<= 0 ~myStatus~0) (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0)))) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= |ULTIMATE.start_CdAudioPnp_~status~2#1| 0) (not (= ~MPR3~0 1)) (= ~routine~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~pended~0 0)) [2022-11-03 02:21:59,292 INFO L899 garLoopResultBuilder]: For program point L295-1(line 295) no Hoare annotation was computed. [2022-11-03 02:21:59,292 INFO L895 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-11-03 02:21:59,293 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1181) no Hoare annotation was computed. [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L1155-1(lines 1118 1460) no Hoare annotation was computed. [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L561(lines 561 867) no Hoare annotation was computed. [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L1024(lines 1024 1483) no Hoare annotation was computed. [2022-11-03 02:21:59,293 INFO L899 garLoopResultBuilder]: For program point L694(lines 694 698) no Hoare annotation was computed. [2022-11-03 02:21:59,294 INFO L895 garLoopResultBuilder]: At program point L562(lines 561 867) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (let ((.cse0 (+ ~myStatus~0 1073741637))) (and (<= .cse0 0) (<= 0 .cse0))) (and (<= 0 ~myStatus~0) (<= ~myStatus~0 0))) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,294 INFO L895 garLoopResultBuilder]: At program point L1553(line 1553) the Hoare annotation is: false [2022-11-03 02:21:59,294 INFO L899 garLoopResultBuilder]: For program point L1553-1(line 1553) no Hoare annotation was computed. [2022-11-03 02:21:59,294 INFO L895 garLoopResultBuilder]: At program point L1355(line 1355) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= 147480 |ULTIMATE.start_CdAudio435DeviceControl_~__cil_tmp42~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,294 INFO L899 garLoopResultBuilder]: For program point L1355-1(line 1355) no Hoare annotation was computed. [2022-11-03 02:21:59,294 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 169) no Hoare annotation was computed. [2022-11-03 02:21:59,295 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 768) no Hoare annotation was computed. [2022-11-03 02:21:59,295 INFO L895 garLoopResultBuilder]: At program point L1290(line 1290) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= |ULTIMATE.start_CdAudio435DeviceControl_~status~6#1| 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:21:59,295 INFO L899 garLoopResultBuilder]: For program point L1290-1(line 1290) no Hoare annotation was computed. [2022-11-03 02:21:59,295 INFO L899 garLoopResultBuilder]: For program point L1158(lines 1158 1177) no Hoare annotation was computed. [2022-11-03 02:21:59,296 INFO L895 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~compRegistered~0 ~routine~0) (= ~customIrp~0 0) (= ~routine~0 1) (= ~pended~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= |old(~routine~0)| 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,296 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2022-11-03 02:21:59,296 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= |old(~routine~0)| 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,296 INFO L899 garLoopResultBuilder]: For program point L1646(lines 1646 1659) no Hoare annotation was computed. [2022-11-03 02:21:59,296 INFO L899 garLoopResultBuilder]: For program point CdAudioForwardIrpSynchronousEXIT(lines 1639 1673) no Hoare annotation was computed. [2022-11-03 02:21:59,297 INFO L895 garLoopResultBuilder]: At program point L1667(line 1667) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= |old(~routine~0)| 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1) (and (<= 259 CdAudioForwardIrpSynchronous_~status~8) (= ~compRegistered~0 ~routine~0) (= ~setEventCalled~0 1) (or (= ~s~0 ~NP~0) (= ~MPR3~0 ~s~0)) (= ~customIrp~0 0) (= ~routine~0 1) (= ~pended~0 0))) [2022-11-03 02:21:59,297 INFO L899 garLoopResultBuilder]: For program point L1667-1(line 1667) no Hoare annotation was computed. [2022-11-03 02:21:59,297 INFO L899 garLoopResultBuilder]: For program point L1665(lines 1665 1670) no Hoare annotation was computed. [2022-11-03 02:21:59,297 INFO L899 garLoopResultBuilder]: For program point L1665-2(lines 1665 1670) no Hoare annotation was computed. [2022-11-03 02:21:59,297 INFO L895 garLoopResultBuilder]: At program point CdAudioForwardIrpSynchronousENTRY(lines 1639 1673) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~routine~0 0) (= ~customIrp~0 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= |old(~routine~0)| 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,298 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= |old(~routine~0)| 0)) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,298 INFO L899 garLoopResultBuilder]: For program point L1651(lines 1651 1658) no Hoare annotation was computed. [2022-11-03 02:21:59,298 INFO L899 garLoopResultBuilder]: For program point L1651-1(lines 1646 1659) no Hoare annotation was computed. [2022-11-03 02:21:59,298 INFO L899 garLoopResultBuilder]: For program point HPCdrCompletionEXIT(lines 1568 1589) no Hoare annotation was computed. [2022-11-03 02:21:59,298 INFO L895 garLoopResultBuilder]: At program point L1578(line 1578) the Hoare annotation is: (or (not (= ~customIrp~0 0)) (not (= ~s~0 ~NP~0)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= 2 ~DC~0)) (not (<= 3 ~SKIP1~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,299 INFO L899 garLoopResultBuilder]: For program point L1574(lines 1574 1580) no Hoare annotation was computed. [2022-11-03 02:21:59,299 INFO L895 garLoopResultBuilder]: At program point HPCdrCompletionENTRY(lines 1568 1589) the Hoare annotation is: (or (not (= ~customIrp~0 0)) (not (= ~s~0 ~NP~0)) (not (<= 7 ~IPC~0)) (not (= |old(~pended~0)| 0)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (and (let ((.cse0 (+ ~myStatus~0 1073741637))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)))) (or (not (<= ~myStatus~0 0)) (not (<= 0 ~myStatus~0)))) (not (= 2 ~DC~0)) (= ~pended~0 0) (not (<= 3 ~SKIP1~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 02:21:59,299 INFO L899 garLoopResultBuilder]: For program point L1573(lines 1573 1581) no Hoare annotation was computed. [2022-11-03 02:21:59,299 INFO L902 garLoopResultBuilder]: At program point L1573-1(lines 1572 1588) the Hoare annotation is: true [2022-11-03 02:21:59,304 INFO L444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:59,306 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:21:59,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:21:59 BoogieIcfgContainer [2022-11-03 02:21:59,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:21:59,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:21:59,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:21:59,429 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:21:59,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:16:50" (3/4) ... [2022-11-03 02:21:59,432 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:21:59,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2022-11-03 02:21:59,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2022-11-03 02:21:59,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2022-11-03 02:21:59,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2022-11-03 02:21:59,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-03 02:21:59,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-03 02:21:59,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-11-03 02:21:59,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2022-11-03 02:21:59,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2022-11-03 02:21:59,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-03 02:21:59,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-03 02:21:59,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2022-11-03 02:21:59,440 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2022-11-03 02:21:59,471 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 143 nodes and edges [2022-11-03 02:21:59,474 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-11-03 02:21:59,476 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:21:59,479 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:21:59,509 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((status + 1073741670 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && status == 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((status + 1 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((status == 0 && \result == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status == 0) && status == 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || s == UNLOADED) || ((((status + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && \result == 0) && customIrp == 0) [2022-11-03 02:21:59,509 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2)) || ((((((7 <= IPC && status <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result == 0) && \result == 0) && customIrp == 0)) || ((((status + 1 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && status + 1 <= 0) && \result + 1 <= 0)) || (((((status + 1 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || (((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status == 0) && status == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result == 0) && status == 0) && customIrp == 0)) || s == UNLOADED) || (((((((((((s == DC && status + 1073741789 <= 0) && 2 == s) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) || ((((status == 0 && \result == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status == 0) && status == 0) [2022-11-03 02:21:59,509 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((2 == DC && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) && status == lowerDriverReturn) && \result == lowerDriverReturn) || ((((((((((status < lowerDriverReturn + 1 && 2 == DC) && !(2 == s)) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn <= returnVal)) || ((((((((((((2 == DC && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) && lowerDriverReturn == status) && status == lowerDriverReturn)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status == 0) && \result == 0) && status == 0) && status == 0)) || (((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && \result + 1 <= 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && \result + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((7 <= IPC && status == 0) && status == 0) && \result == 0) && \result == 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((7 <= IPC && status == 0) && status == 0) && \result == 0) && status == 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((7 <= IPC && status <= 0) && status <= 0) && myStatus <= 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0))) && \result <= 0) [2022-11-03 02:21:59,511 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(NP == \old(s))) || (s == NP && customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) || !(pended == 0)) && ((((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || (s == NP && customIrp == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || MPR3 == 1) || !(pended == 0)) [2022-11-03 02:21:59,511 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || ((((((setEventCalled == 1 && 0 <= __cil_tmp8 + 1073741802) && compRetStatus + 1073741802 <= 0) && __cil_tmp8 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && pended == 0) && MPR1 == s)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || s == NP) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1)) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(SKIP1 == \old(s))) || (SKIP1 == s && pended == 0)) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) [2022-11-03 02:21:59,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\result == lowerDriverReturn && 7 <= IPC) && 2 == DC) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0) && SKIP2 == s) || ((((((((((((s == DC && 2 == s) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((\result + 1 <= 0 && s == DC) && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((s == DC && status + 1073741670 <= 0) && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && \result + 1073741670 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) [2022-11-03 02:21:59,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || ((((((((((((s == DC && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) [2022-11-03 02:21:59,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s) || ((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && 2 == s) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status <= 0) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && myStatus <= 0) && pended == 0) && \result <= 0)) || ((((((((((((((compRegistered == 1 && 7 <= IPC) && status == 0) && 2 == DC) && 2 == s) && \result == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && pended == 0)) || ((((((((((((((compRegistered == 1 && status + 1 <= 0) && \result + 1 <= 0) && 7 <= IPC) && 2 == DC) && 2 == s) && \result + 1 <= 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && pended == 0) [2022-11-03 02:21:59,513 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || ((((((setEventCalled == 1 && 0 <= __cil_tmp8 + 1073741802) && compRetStatus + 1073741802 <= 0) && __cil_tmp8 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && pended == 0) && MPR1 == s)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || s == NP) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1)) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(SKIP1 == \old(s))) || (SKIP1 == s && pended == 0)) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) [2022-11-03 02:21:59,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == DC && \result == lowerDriverReturn) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && 4 <= SKIP2) [2022-11-03 02:21:59,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == DC && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((((((s == DC && status + 1073741670 <= 0) && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((s == DC && 2 == s) && 1073741789 + status <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((((((((((\result + 1 <= 0 && s == DC) && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((((7 <= IPC && s == DC) && 2 == s) && status == 0) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741670 <= 0) && 4 <= SKIP2) && \result + 1073741670 <= 0) && pended == 0) && compRegistered == 0) && status + 1073741670 <= 0)) || (((((((((((((s == DC && 2 == s) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && status == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((((s == DC && 2 == s) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && 4 <= SKIP2) [2022-11-03 02:21:59,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((status + 1073741670 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && status == 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((status + 1 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((status == 0 && \result == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status == 0) && status == 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || ((((status + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && \result == 0) && customIrp == 0) [2022-11-03 02:21:59,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((7 <= IPC && s == DC) && 2 == s) && status == 0) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && \result + 1073741670 <= 0) && pended == 0) && compRegistered == 0) && status + 1073741670 <= 0)) || (((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) [2022-11-03 02:21:59,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(NP == \old(s))) || (s == NP && customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) || !(pended == 0)) && ((((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || (((setEventCalled == 1 && customIrp == 0) && s == \old(s)) && !(MPR3 == \old(s)))) || !(compRegistered == routine)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || MPR3 == 1) || !(pended == 0)) [2022-11-03 02:21:59,525 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && s == NP) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) || ((((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && \result + 1 <= 0) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) [2022-11-03 02:21:59,659 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:21:59,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:21:59,660 INFO L158 Benchmark]: Toolchain (without parser) took 311752.89ms. Allocated memory was 92.3MB in the beginning and 704.6MB in the end (delta: 612.4MB). Free memory was 55.7MB in the beginning and 289.0MB in the end (delta: -233.3MB). Peak memory consumption was 378.3MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,660 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 92.3MB. Free memory was 63.8MB in the beginning and 63.8MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:59,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.37ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 55.5MB in the beginning and 87.2MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.53ms. Allocated memory is still 130.0MB. Free memory was 87.2MB in the beginning and 80.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,661 INFO L158 Benchmark]: Boogie Preprocessor took 70.96ms. Allocated memory is still 130.0MB. Free memory was 80.3MB in the beginning and 74.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,661 INFO L158 Benchmark]: RCFGBuilder took 1742.19ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 57.2MB in the end (delta: 17.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,661 INFO L158 Benchmark]: TraceAbstraction took 308830.70ms. Allocated memory was 130.0MB in the beginning and 704.6MB in the end (delta: 574.6MB). Free memory was 57.2MB in the beginning and 315.2MB in the end (delta: -258.0MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,662 INFO L158 Benchmark]: Witness Printer took 230.90ms. Allocated memory is still 704.6MB. Free memory was 315.2MB in the beginning and 289.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-03 02:21:59,663 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.23ms. Allocated memory is still 92.3MB. Free memory was 63.8MB in the beginning and 63.8MB in the end (delta: 27.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.37ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 55.5MB in the beginning and 87.2MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.53ms. Allocated memory is still 130.0MB. Free memory was 87.2MB in the beginning and 80.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.96ms. Allocated memory is still 130.0MB. Free memory was 80.3MB in the beginning and 74.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1742.19ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 57.2MB in the end (delta: 17.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 308830.70ms. Allocated memory was 130.0MB in the beginning and 704.6MB in the end (delta: 574.6MB). Free memory was 57.2MB in the beginning and 315.2MB in the end (delta: -258.0MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. * Witness Printer took 230.90ms. Allocated memory is still 704.6MB. Free memory was 315.2MB in the beginning and 289.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 59]: 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 14 procedures, 348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 308.6s, OverallIterations: 69, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 273.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8587 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8472 mSDsluCounter, 96588 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86085 mSDsCounter, 718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21006 IncrementalHoareTripleChecker+Invalid, 21724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 718 mSolverCounterUnsat, 21631 mSDtfsCounter, 21006 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=4, InterpolantAutomatonStates: 445, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 69 MinimizatonAttempts, 849 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 150 LocationsWithAnnotation, 1131 PreInvPairs, 1407 NumberOfFragments, 15012 HoareAnnotationTreeSize, 1131 FomulaSimplifications, 1008 FormulaSimplificationTreeSizeReduction, 254.2s HoareSimplificationTime, 150 FomulaSimplificationsInter, 46804389 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2665 NumberOfCodeBlocks, 2665 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 2595 ConstructedInterpolants, 0 QuantifiedInterpolants, 6227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 70 InterpolantComputations, 69 PerfectInterpolantSequences, 19/21 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: 1825]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((status + 1073741670 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && status == 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((status + 1 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((status == 0 && \result == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status == 0) && status == 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || s == UNLOADED) || ((((status + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && \result == 0) && customIrp == 0) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1781]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1717]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1118]: Loop Invariant Derived loop invariant: (((((((((((((2 == DC && status + 1 <= 0) && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1069]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((((((((((((7 <= IPC && s == DC) && 2 == s) && status == 0) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && \result + 1073741670 <= 0) && pended == 0) && compRegistered == 0) && status + 1073741670 <= 0)) || (((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1843]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 == DC && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) && status == lowerDriverReturn) && \result == lowerDriverReturn) || ((((((((((status < lowerDriverReturn + 1 && 2 == DC) && !(2 == s)) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && lowerDriverReturn <= returnVal)) || ((((((((((((2 == DC && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && !(2 == s)) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) && lowerDriverReturn == status) && status == lowerDriverReturn)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status == 0) && \result == 0) && status == 0) && status == 0)) || (((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && \result + 1 <= 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && \result + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || (((((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((7 <= IPC && status == 0) && status == 0) && \result == 0) && \result == 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((7 <= IPC && status == 0) && status == 0) && \result == 0) && status == 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0)))) || (((((7 <= IPC && status <= 0) && status <= 0) && myStatus <= 0) && (((((((((((((compRegistered == 1 && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0)) && customIrp == 0))) && \result <= 0) - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1042]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1791]: Loop Invariant Derived loop invariant: (((((((2 == DC && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s) || ((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && 2 == s) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status <= 0) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && myStatus <= 0) && pended == 0) && \result <= 0)) || ((((((((((((((compRegistered == 1 && 7 <= IPC) && status == 0) && 2 == DC) && 2 == s) && \result == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && pended == 0)) || ((((((((((((((compRegistered == 1 && status + 1 <= 0) && \result + 1 <= 0) && 7 <= IPC) && 2 == DC) && 2 == s) && \result + 1 <= 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 2052]: Loop Invariant Derived loop invariant: (((((((2 == DC && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 2099]: Loop Invariant Derived loop invariant: (((((((((2 == DC && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2) || ((((status + 1073741670 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && status == 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((status + 1 <= 0 && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || ((((status == 0 && \result == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status == 0) && status == 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((((((((2 == DC && s == DC) && status + 1073741789 <= 0) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || (((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || ((((status + 1 <= 0 && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && status + 1 <= 0) && \result + 1 <= 0)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status <= 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((7 <= IPC && status == 0) && status == 0) && ((((((((((2 == DC && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((compRegistered == 1 && 2 == DC) && s == DC) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0))) && \result == 0) && \result == 0) && customIrp == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: ((((((((((((status + 1 <= 0 && 7 <= IPC) && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1901]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || ((((((setEventCalled == 1 && 0 <= __cil_tmp8 + 1073741802) && compRetStatus + 1073741802 <= 0) && __cil_tmp8 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && pended == 0) && MPR1 == s)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || s == NP) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1)) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(SKIP1 == \old(s))) || (SKIP1 == s && pended == 0)) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1786]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 894]: Loop Invariant Derived loop invariant: ((((((((((((((((\result == lowerDriverReturn && 7 <= IPC) && 2 == DC) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0) && SKIP2 == s) || ((((((((((((s == DC && 2 == s) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((\result + 1 <= 0 && s == DC) && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((s == DC && status + 1073741670 <= 0) && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && \result + 1073741670 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1500]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \result && 2 == DC) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || ((((((((((((s == DC && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1833]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((status < lowerDriverReturn + 1 && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && returnVal <= lowerDriverReturn) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal)) || (((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && status == lowerDriverReturn) && 4 <= SKIP2)) || ((((((7 <= IPC && status <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && customIrp == 0) && status <= 0) && myStatus <= 0) && \result <= 0)) || ((((((7 <= IPC && status == 0) && status == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result == 0) && \result == 0) && customIrp == 0)) || ((((status + 1 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && status + 1 <= 0) && \result + 1 <= 0)) || (((((status + 1 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && customIrp == 0) && \result + 1 <= 0) && status + 1 <= 0)) || (((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && \result == lowerDriverReturn) && SKIP2 == s)) || ((((((status + 1 <= 0 && \result + 1 <= 0) && 7 <= IPC) && status + 1 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result + 1 <= 0) && customIrp == 0)) || ((((status + 1073741670 <= 0 && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && status + 1073741670 <= 0)) || ((((status + 1073741670 <= 0 && status + 1073741670 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1073741670 <= 0) && \result + 1073741670 <= 0)) || (((((\result + 1 <= 0 && status + 1 <= 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status + 1 <= 0) && status + 1 <= 0) && customIrp == 0)) || ((((((7 <= IPC && status == 0) && status == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && \result == 0) && status == 0) && customIrp == 0)) || s == UNLOADED) || (((((((((((s == DC && status + 1073741789 <= 0) && 2 == s) && 1073741789 + status <= 0) && !(IPC == 2)) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2)) || ((((status == 0 && \result == 0) && (((((((((compRegistered == 1 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) || ((((((((s == DC && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0))) && status == 0) && status == 0) - InvariantResult [Line: 2006]: Loop Invariant Derived loop invariant: (((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(NP == \old(s))) || (s == NP && customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) || !(pended == 0)) && ((((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || (s == NP && customIrp == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || MPR3 == 1) || !(pended == 0)) - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (((((((((((((((7 <= IPC && 2 == DC) && !(2 == s)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && s == UNLOADED) && customIrp == 0) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1) - InvariantResult [Line: 597]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 2006]: Loop Invariant Derived loop invariant: (((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(NP == \old(s))) || (s == NP && customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) || !(pended == 0)) && ((((((((((((((!(NP == 1) || !(\old(customIrp) == 0)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || (((setEventCalled == 1 && customIrp == 0) && s == \old(s)) && !(MPR3 == \old(s)))) || !(compRegistered == routine)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || MPR3 == 1) || !(pended == 0)) - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 2051]: Loop Invariant Derived loop invariant: (((((((2 == DC && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0 - InvariantResult [Line: 1590]: Loop Invariant Derived loop invariant: ((((((((((((2 == DC && \result == lowerDriverReturn) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && 4 <= SKIP2) - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s == DC && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((((((s == DC && status + 1073741670 <= 0) && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741670 <= 0) && \result + 1073741670 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((s == DC && 2 == s) && 1073741789 + status <= 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && 1073741789 + status <= 0) && SKIP1 + 2 <= MPR1) && \result + 1073741789 <= 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((((((((((\result + 1 <= 0 && s == DC) && 2 == s) && status + 1 <= 0) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((((7 <= IPC && s == DC) && 2 == s) && status == 0) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((((s == DC && 2 == s) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status + 1073741670 <= 0) && 4 <= SKIP2) && \result + 1073741670 <= 0) && pended == 0) && compRegistered == 0) && status + 1073741670 <= 0)) || (((((((((((((s == DC && 2 == s) && \result == 0) && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && status == 0) && status == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || (((((((((((2 == DC && !(IPC == 2)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((((s == DC && 2 == s) && !(IPC == 2)) && status + 1 <= 0) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && \result + 1 <= 0) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((((compRegistered == 1 && 7 <= IPC) && 2 == DC) && \result == lowerDriverReturn) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == status) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && IPC == s) && 4 <= SKIP2) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && !(status + 1 <= 0)) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0 - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((((((((((7 <= IPC && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0) || ((((((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && status + 1073741670 <= 0)) || ((((((((((((((7 <= IPC && 2 == DC) && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0)) || (((((((((((status + 1073741789 <= 0 && 2 == DC) && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((((((((((status + 1 <= 0 && 7 <= IPC) && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0 - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && status + 1 <= 0) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(IPC == 2)) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: ((((((((((((7 <= IPC && 2 == DC) && s == NP) && routine == 0) && 3 <= SKIP1) && 147480 <= __cil_tmp42) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && s == NP) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) || ((((((((((((((status + 1 <= 0 && compRegistered == routine) && 7 <= IPC) && 2 == DC) && \result + 1 <= 0) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && !(MPR3 == 1)) && routine == 1) && 4 <= SKIP2) && ((myStatus + 1073741637 <= 0 && 0 <= myStatus + 1073741637) || (0 <= myStatus && myStatus <= 0))) && pended == 0) - InvariantResult [Line: 1901]: Loop Invariant Derived loop invariant: ((((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(compRegistered == routine)) || ((((((setEventCalled == 1 && 0 <= __cil_tmp8 + 1073741802) && compRetStatus + 1073741802 <= 0) && __cil_tmp8 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && pended == 0) && MPR1 == s)) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(NP == \old(s))) || !(7 <= IPC)) || !(\old(pended) == 0)) || s == NP) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(2 == DC)) || !(3 <= SKIP1)) || !(compRegistered == 1)) || MPR3 == 1)) && (((((((((((((!(NP == 1) || !(customIrp == 0)) || !(compRegistered == 0)) || !(7 <= IPC)) || !(\old(pended) == 0)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || ((!(myStatus + 1073741637 <= 0) || !(0 <= myStatus + 1073741637)) && (!(myStatus <= 0) || !(0 <= myStatus)))) || !(SKIP1 == \old(s))) || (SKIP1 == s && pended == 0)) || !(2 == DC)) || !(3 <= SKIP1)) || MPR3 == 1) RESULT: Ultimate proved your program to be correct! [2022-11-03 02:21:59,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a6b17db-e51e-4f63-862b-88f1e46bd7e4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE