./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/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_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/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_f184c740-9c7d-4f24-8d49-5c0b2977d931/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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- 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:41:32,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:41:32,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:41:32,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:41:32,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:41:32,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:41:32,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:41:32,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:41:32,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:41:32,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:41:32,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:41:32,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:41:32,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:41:32,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:41:32,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:41:32,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:41:32,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:41:32,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:41:32,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:41:32,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:41:32,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:41:32,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:41:32,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:41:32,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:41:32,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:41:32,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:41:32,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:41:32,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:41:32,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:41:32,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:41:32,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:41:32,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:41:32,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:41:32,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:41:32,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:41:32,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:41:32,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:41:32,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:41:32,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:41:32,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:41:32,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:41:32,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:41:32,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:41:32,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:41:32,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:41:32,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:41:32,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:41:32,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:41:32,144 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:41:32,144 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:41:32,144 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:41:32,144 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:41:32,145 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:41:32,145 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:41:32,145 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:41:32,145 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:41:32,146 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:41:32,146 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:41:32,146 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:41:32,146 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:41:32,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:41:32,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:41:32,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:41:32,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:41:32,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:41:32,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:41:32,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:41:32,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:41:32,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:41:32,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:41:32,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:41:32,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:41:32,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:41:32,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:41:32,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:32,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:41:32,151 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:41:32,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:41:32,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:41:32,152 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:41:32,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:41:32,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:41:32,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:41:32,153 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_f184c740-9c7d-4f24-8d49-5c0b2977d931/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_f184c740-9c7d-4f24-8d49-5c0b2977d931/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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2022-11-03 02:41:32,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:41:32,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:41:32,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:41:32,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:41:32,465 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:41:32,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-11-03 02:41:32,564 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/data/778a0ecc1/ce711d58bf3a4de9bed1d4e8794e695f/FLAGa5914cf70 [2022-11-03 02:41:33,099 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:41:33,100 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-11-03 02:41:33,111 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/data/778a0ecc1/ce711d58bf3a4de9bed1d4e8794e695f/FLAGa5914cf70 [2022-11-03 02:41:33,424 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/data/778a0ecc1/ce711d58bf3a4de9bed1d4e8794e695f [2022-11-03 02:41:33,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:41:33,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:41:33,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:33,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:41:33,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:41:33,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:33,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137bbcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33, skipping insertion in model container [2022-11-03 02:41:33,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:33,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:41:33,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:41:33,685 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_f184c740-9c7d-4f24-8d49-5c0b2977d931/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-11-03 02:41:33,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:33,803 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:41:33,818 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_f184c740-9c7d-4f24-8d49-5c0b2977d931/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-11-03 02:41:33,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:33,944 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:41:33,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33 WrapperNode [2022-11-03 02:41:33,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:33,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:33,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:41:33,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:41:33,952 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:41:33" (1/1) ... [2022-11-03 02:41:33,966 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:41:33" (1/1) ... [2022-11-03 02:41:34,015 INFO L138 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-11-03 02:41:34,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:34,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:41:34,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:41:34,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:41:34,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,056 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:41:34,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:41:34,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:41:34,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:41:34,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (1/1) ... [2022-11-03 02:41:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:34,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:41:34,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:41:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:41:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-03 02:41:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-03 02:41:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-03 02:41:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-03 02:41:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 02:41:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 02:41:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-11-03 02:41:34,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-11-03 02:41:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-11-03 02:41:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-11-03 02:41:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 02:41:34,181 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 02:41:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:41:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 02:41:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 02:41:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-11-03 02:41:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-11-03 02:41:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-11-03 02:41:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-11-03 02:41:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:41:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:41:34,417 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:41:34,419 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:41:34,440 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:34,527 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-03 02:41:34,527 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-03 02:41:34,529 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-03 02:41:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-03 02:41:34,660 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:34,667 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:34,692 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:35,222 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-11-03 02:41:35,223 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-11-03 02:41:35,223 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-03 02:41:35,223 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-03 02:41:35,224 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-11-03 02:41:35,224 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-11-03 02:41:35,225 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:41:35,265 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-03 02:41:35,265 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-03 02:41:35,330 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:41:35,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:41:35,496 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:41:35,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:35 BoogieIcfgContainer [2022-11-03 02:41:35,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:41:35,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:41:35,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:41:35,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:41:35,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:41:33" (1/3) ... [2022-11-03 02:41:35,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729d320d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:35, skipping insertion in model container [2022-11-03 02:41:35,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:33" (2/3) ... [2022-11-03 02:41:35,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729d320d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:35, skipping insertion in model container [2022-11-03 02:41:35,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:35" (3/3) ... [2022-11-03 02:41:35,512 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-11-03 02:41:35,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:41:35,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:41:35,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:41:35,616 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;@57b9d6e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:41:35,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:41:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-03 02:41:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:41:35,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:35,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:35,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1518887749, now seen corresponding path program 1 times [2022-11-03 02:41:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:35,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827023177] [2022-11-03 02:41:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:36,054 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:41:36,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:36,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827023177] [2022-11-03 02:41:36,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827023177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:36,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:36,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256435398] [2022-11-03 02:41:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:36,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:36,103 INFO L87 Difference]: Start difference. First operand has 189 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 151 states have internal predecessors, (205), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:36,533 INFO L93 Difference]: Finished difference Result 419 states and 667 transitions. [2022-11-03 02:41:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:41:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:36,546 INFO L225 Difference]: With dead ends: 419 [2022-11-03 02:41:36,547 INFO L226 Difference]: Without dead ends: 251 [2022-11-03 02:41:36,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:36,555 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 425 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:36,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 373 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-03 02:41:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2022-11-03 02:41:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 191 states have internal predecessors, (254), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2022-11-03 02:41:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 358 transitions. [2022-11-03 02:41:36,652 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 358 transitions. Word has length 9 [2022-11-03 02:41:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:36,653 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 358 transitions. [2022-11-03 02:41:36,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 358 transitions. [2022-11-03 02:41:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:41:36,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:36,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:41:36,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2001954206, now seen corresponding path program 1 times [2022-11-03 02:41:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748145843] [2022-11-03 02:41:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:36,695 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:41:36,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:36,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748145843] [2022-11-03 02:41:36,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748145843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:36,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:36,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:41:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368511637] [2022-11-03 02:41:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:36,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:36,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:36,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:36,699 INFO L87 Difference]: Start difference. First operand 248 states and 358 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:36,876 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2022-11-03 02:41:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:36,877 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:41:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:36,879 INFO L225 Difference]: With dead ends: 268 [2022-11-03 02:41:36,880 INFO L226 Difference]: Without dead ends: 248 [2022-11-03 02:41:36,880 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:41:36,882 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:36,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-03 02:41:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-03 02:41:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 191 states have internal predecessors, (253), 54 states have call successors, (54), 15 states have call predecessors, (54), 13 states have return successors, (50), 43 states have call predecessors, (50), 43 states have call successors, (50) [2022-11-03 02:41:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 357 transitions. [2022-11-03 02:41:36,929 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 357 transitions. Word has length 11 [2022-11-03 02:41:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:36,930 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 357 transitions. [2022-11-03 02:41:36,930 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:41:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 357 transitions. [2022-11-03 02:41:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:41:36,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:36,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:41:36,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2009523838, now seen corresponding path program 1 times [2022-11-03 02:41:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:36,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057813475] [2022-11-03 02:41:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:37,098 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:41:37,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:37,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057813475] [2022-11-03 02:41:37,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057813475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:37,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:37,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940135148] [2022-11-03 02:41:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:37,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:37,101 INFO L87 Difference]: Start difference. First operand 248 states and 357 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:37,217 INFO L93 Difference]: Finished difference Result 574 states and 843 transitions. [2022-11-03 02:41:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:41:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:37,221 INFO L225 Difference]: With dead ends: 574 [2022-11-03 02:41:37,221 INFO L226 Difference]: Without dead ends: 388 [2022-11-03 02:41:37,222 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:41:37,223 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 203 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:37,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 414 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-03 02:41:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 360. [2022-11-03 02:41:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 263 states have (on average 1.391634980988593) internal successors, (366), 271 states have internal predecessors, (366), 75 states have call successors, (75), 22 states have call predecessors, (75), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2022-11-03 02:41:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 531 transitions. [2022-11-03 02:41:37,267 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 531 transitions. Word has length 13 [2022-11-03 02:41:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:37,268 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 531 transitions. [2022-11-03 02:41:37,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 531 transitions. [2022-11-03 02:41:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:41:37,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:37,272 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:41:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:41:37,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1641123002, now seen corresponding path program 1 times [2022-11-03 02:41:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:37,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747591159] [2022-11-03 02:41:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:37,363 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:41:37,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747591159] [2022-11-03 02:41:37,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747591159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:37,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:37,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941918562] [2022-11-03 02:41:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:37,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:37,367 INFO L87 Difference]: Start difference. First operand 360 states and 531 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:37,521 INFO L93 Difference]: Finished difference Result 369 states and 542 transitions. [2022-11-03 02:41:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:41:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:37,528 INFO L225 Difference]: With dead ends: 369 [2022-11-03 02:41:37,528 INFO L226 Difference]: Without dead ends: 365 [2022-11-03 02:41:37,529 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:41:37,540 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:37,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 375 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-03 02:41:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-03 02:41:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3866171003717471) internal successors, (373), 275 states have internal predecessors, (373), 74 states have call successors, (74), 23 states have call predecessors, (74), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2022-11-03 02:41:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 537 transitions. [2022-11-03 02:41:37,603 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 537 transitions. Word has length 16 [2022-11-03 02:41:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:37,604 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 537 transitions. [2022-11-03 02:41:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 537 transitions. [2022-11-03 02:41:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:41:37,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:37,615 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] [2022-11-03 02:41:37,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:41:37,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1270154044, now seen corresponding path program 1 times [2022-11-03 02:41:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647035546] [2022-11-03 02:41:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:37,733 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:41:37,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647035546] [2022-11-03 02:41:37,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647035546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:37,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:37,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956874523] [2022-11-03 02:41:37,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:37,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:37,736 INFO L87 Difference]: Start difference. First operand 365 states and 537 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:38,095 INFO L93 Difference]: Finished difference Result 394 states and 573 transitions. [2022-11-03 02:41:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-03 02:41:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:38,098 INFO L225 Difference]: With dead ends: 394 [2022-11-03 02:41:38,099 INFO L226 Difference]: Without dead ends: 383 [2022-11-03 02:41:38,099 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:41:38,100 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 297 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:38,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 412 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-03 02:41:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2022-11-03 02:41:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 283 states have (on average 1.3816254416961131) internal successors, (391), 289 states have internal predecessors, (391), 74 states have call successors, (74), 23 states have call predecessors, (74), 21 states have return successors, (90), 67 states have call predecessors, (90), 65 states have call successors, (90) [2022-11-03 02:41:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 555 transitions. [2022-11-03 02:41:38,139 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 555 transitions. Word has length 20 [2022-11-03 02:41:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:38,139 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 555 transitions. [2022-11-03 02:41:38,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 555 transitions. [2022-11-03 02:41:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:41:38,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:38,141 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:41:38,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:41:38,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -126895172, now seen corresponding path program 1 times [2022-11-03 02:41:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:38,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333070536] [2022-11-03 02:41:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:38,214 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:41:38,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:38,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333070536] [2022-11-03 02:41:38,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333070536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:38,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:38,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020016236] [2022-11-03 02:41:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:38,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:38,218 INFO L87 Difference]: Start difference. First operand 379 states and 555 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:38,313 INFO L93 Difference]: Finished difference Result 646 states and 959 transitions. [2022-11-03 02:41:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:41:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:38,318 INFO L225 Difference]: With dead ends: 646 [2022-11-03 02:41:38,318 INFO L226 Difference]: Without dead ends: 360 [2022-11-03 02:41:38,319 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:41:38,320 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:38,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:41:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-03 02:41:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-11-03 02:41:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 269 states have (on average 1.3717472118959109) internal successors, (369), 274 states have internal predecessors, (369), 71 states have call successors, (71), 21 states have call predecessors, (71), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2022-11-03 02:41:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 528 transitions. [2022-11-03 02:41:38,373 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 528 transitions. Word has length 23 [2022-11-03 02:41:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:38,374 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 528 transitions. [2022-11-03 02:41:38,374 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), 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:41:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 528 transitions. [2022-11-03 02:41:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:41:38,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:38,376 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:41:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:41:38,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1156263919, now seen corresponding path program 1 times [2022-11-03 02:41:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004341028] [2022-11-03 02:41:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:38,494 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:41:38,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004341028] [2022-11-03 02:41:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004341028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:38,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:38,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773488483] [2022-11-03 02:41:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:38,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:38,497 INFO L87 Difference]: Start difference. First operand 360 states and 528 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:38,789 INFO L93 Difference]: Finished difference Result 372 states and 539 transitions. [2022-11-03 02:41:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-03 02:41:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:38,792 INFO L225 Difference]: With dead ends: 372 [2022-11-03 02:41:38,793 INFO L226 Difference]: Without dead ends: 364 [2022-11-03 02:41:38,793 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:41:38,794 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 279 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:38,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 380 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-03 02:41:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2022-11-03 02:41:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 269 states have (on average 1.3680297397769516) internal successors, (368), 274 states have internal predecessors, (368), 71 states have call successors, (71), 21 states have call predecessors, (71), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2022-11-03 02:41:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 527 transitions. [2022-11-03 02:41:38,842 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 527 transitions. Word has length 21 [2022-11-03 02:41:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:38,842 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 527 transitions. [2022-11-03 02:41:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 527 transitions. [2022-11-03 02:41:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:41:38,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:38,844 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:41:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:41:38,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1751632997, now seen corresponding path program 1 times [2022-11-03 02:41:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:38,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788328031] [2022-11-03 02:41:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:38,890 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:41:38,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:38,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788328031] [2022-11-03 02:41:38,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788328031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:38,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:38,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090832477] [2022-11-03 02:41:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:38,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:38,892 INFO L87 Difference]: Start difference. First operand 360 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:38,975 INFO L93 Difference]: Finished difference Result 383 states and 557 transitions. [2022-11-03 02:41:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-03 02:41:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:38,978 INFO L225 Difference]: With dead ends: 383 [2022-11-03 02:41:38,978 INFO L226 Difference]: Without dead ends: 354 [2022-11-03 02:41:38,979 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:41:38,980 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:38,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 186 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:41:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-03 02:41:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-11-03 02:41:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 264 states have (on average 1.3522727272727273) internal successors, (357), 268 states have internal predecessors, (357), 70 states have call successors, (70), 21 states have call predecessors, (70), 19 states have return successors, (88), 65 states have call predecessors, (88), 63 states have call successors, (88) [2022-11-03 02:41:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 515 transitions. [2022-11-03 02:41:39,040 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 515 transitions. Word has length 22 [2022-11-03 02:41:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:39,040 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 515 transitions. [2022-11-03 02:41:39,040 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, (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:41:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 515 transitions. [2022-11-03 02:41:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:41:39,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:39,041 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:41:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:41:39,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1542340409, now seen corresponding path program 1 times [2022-11-03 02:41:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497293398] [2022-11-03 02:41:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:39,096 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:41:39,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497293398] [2022-11-03 02:41:39,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497293398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:39,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:39,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172501017] [2022-11-03 02:41:39,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:39,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:39,099 INFO L87 Difference]: Start difference. First operand 354 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:39,195 INFO L93 Difference]: Finished difference Result 368 states and 528 transitions. [2022-11-03 02:41:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-03 02:41:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:39,200 INFO L225 Difference]: With dead ends: 368 [2022-11-03 02:41:39,200 INFO L226 Difference]: Without dead ends: 352 [2022-11-03 02:41:39,200 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:41:39,203 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:39,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-03 02:41:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-11-03 02:41:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 263 states have (on average 1.349809885931559) internal successors, (355), 267 states have internal predecessors, (355), 69 states have call successors, (69), 21 states have call predecessors, (69), 19 states have return successors, (87), 64 states have call predecessors, (87), 62 states have call successors, (87) [2022-11-03 02:41:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 511 transitions. [2022-11-03 02:41:39,248 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 511 transitions. Word has length 23 [2022-11-03 02:41:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:39,248 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 511 transitions. [2022-11-03 02:41:39,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 511 transitions. [2022-11-03 02:41:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:41:39,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:39,249 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:41:39,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:41:39,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1306958918, now seen corresponding path program 1 times [2022-11-03 02:41:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:39,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457976902] [2022-11-03 02:41:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:39,305 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:41:39,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457976902] [2022-11-03 02:41:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457976902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:39,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454456104] [2022-11-03 02:41:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:39,308 INFO L87 Difference]: Start difference. First operand 352 states and 511 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:39,488 INFO L93 Difference]: Finished difference Result 522 states and 796 transitions. [2022-11-03 02:41:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:41:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:39,492 INFO L225 Difference]: With dead ends: 522 [2022-11-03 02:41:39,492 INFO L226 Difference]: Without dead ends: 514 [2022-11-03 02:41:39,492 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:41:39,493 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 139 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:39,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 370 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-03 02:41:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 397. [2022-11-03 02:41:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3557046979865772) internal successors, (404), 302 states have internal predecessors, (404), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2022-11-03 02:41:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 587 transitions. [2022-11-03 02:41:39,550 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 587 transitions. Word has length 23 [2022-11-03 02:41:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 587 transitions. [2022-11-03 02:41:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 587 transitions. [2022-11-03 02:41:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:41:39,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:39,554 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:41:39,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:41:39,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1407663317, now seen corresponding path program 1 times [2022-11-03 02:41:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:39,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512375389] [2022-11-03 02:41:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:39,641 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:41:39,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:39,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512375389] [2022-11-03 02:41:39,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512375389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:39,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:39,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322584997] [2022-11-03 02:41:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:39,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:39,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:39,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:39,644 INFO L87 Difference]: Start difference. First operand 397 states and 587 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:40,021 INFO L93 Difference]: Finished difference Result 522 states and 795 transitions. [2022-11-03 02:41:40,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:40,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:41:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:40,024 INFO L225 Difference]: With dead ends: 522 [2022-11-03 02:41:40,025 INFO L226 Difference]: Without dead ends: 514 [2022-11-03 02:41:40,025 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:41:40,026 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 379 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:40,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 303 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-03 02:41:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 397. [2022-11-03 02:41:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3523489932885906) internal successors, (403), 302 states have internal predecessors, (403), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2022-11-03 02:41:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 586 transitions. [2022-11-03 02:41:40,086 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 586 transitions. Word has length 24 [2022-11-03 02:41:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:40,088 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 586 transitions. [2022-11-03 02:41:40,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 586 transitions. [2022-11-03 02:41:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:41:40,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:40,090 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:41:40,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:41:40,091 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -636636042, now seen corresponding path program 1 times [2022-11-03 02:41:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:40,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522116118] [2022-11-03 02:41:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:40,169 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:41:40,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:40,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522116118] [2022-11-03 02:41:40,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522116118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:40,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:40,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840888147] [2022-11-03 02:41:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:40,172 INFO L87 Difference]: Start difference. First operand 397 states and 586 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:40,415 INFO L93 Difference]: Finished difference Result 421 states and 613 transitions. [2022-11-03 02:41:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:40,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:41:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:40,418 INFO L225 Difference]: With dead ends: 421 [2022-11-03 02:41:40,418 INFO L226 Difference]: Without dead ends: 397 [2022-11-03 02:41:40,420 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:41:40,420 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 212 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:40,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 273 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-03 02:41:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-11-03 02:41:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 298 states have (on average 1.3456375838926173) internal successors, (401), 302 states have internal predecessors, (401), 76 states have call successors, (76), 23 states have call predecessors, (76), 22 states have return successors, (107), 72 states have call predecessors, (107), 69 states have call successors, (107) [2022-11-03 02:41:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 584 transitions. [2022-11-03 02:41:40,474 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 584 transitions. Word has length 24 [2022-11-03 02:41:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:40,475 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 584 transitions. [2022-11-03 02:41:40,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 584 transitions. [2022-11-03 02:41:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:41:40,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:40,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:41:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:41:40,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1878976399, now seen corresponding path program 1 times [2022-11-03 02:41:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888575604] [2022-11-03 02:41:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:40,532 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:41:40,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:40,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888575604] [2022-11-03 02:41:40,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888575604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:40,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:40,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:41:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128385464] [2022-11-03 02:41:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:40,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:40,536 INFO L87 Difference]: Start difference. First operand 397 states and 584 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:40,712 INFO L93 Difference]: Finished difference Result 444 states and 626 transitions. [2022-11-03 02:41:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-03 02:41:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:40,714 INFO L225 Difference]: With dead ends: 444 [2022-11-03 02:41:40,714 INFO L226 Difference]: Without dead ends: 266 [2022-11-03 02:41:40,715 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:41:40,716 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 229 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:40,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 350 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-03 02:41:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2022-11-03 02:41:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 193 states have (on average 1.2746113989637307) internal successors, (246), 198 states have internal predecessors, (246), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (45), 38 states have call predecessors, (45), 37 states have call successors, (45) [2022-11-03 02:41:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2022-11-03 02:41:40,753 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 28 [2022-11-03 02:41:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:40,755 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2022-11-03 02:41:40,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2022-11-03 02:41:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:41:40,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:40,757 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:41:40,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:41:40,757 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1584967708, now seen corresponding path program 1 times [2022-11-03 02:41:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49105238] [2022-11-03 02:41:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:40,833 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:41:40,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:40,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49105238] [2022-11-03 02:41:40,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49105238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:40,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:40,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463772696] [2022-11-03 02:41:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:40,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:40,836 INFO L87 Difference]: Start difference. First operand 252 states and 335 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:41,054 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2022-11-03 02:41:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:41,055 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:41:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:41,056 INFO L225 Difference]: With dead ends: 269 [2022-11-03 02:41:41,057 INFO L226 Difference]: Without dead ends: 249 [2022-11-03 02:41:41,057 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:41:41,059 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 213 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:41,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 266 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-03 02:41:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-03 02:41:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 190 states have (on average 1.268421052631579) internal successors, (241), 196 states have internal predecessors, (241), 44 states have call successors, (44), 16 states have call predecessors, (44), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-03 02:41:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2022-11-03 02:41:41,097 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 25 [2022-11-03 02:41:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:41,097 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2022-11-03 02:41:41,098 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:41:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2022-11-03 02:41:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:41:41,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:41,099 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:41:41,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:41:41,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 781876277, now seen corresponding path program 1 times [2022-11-03 02:41:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5880874] [2022-11-03 02:41:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:41,131 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:41:41,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:41,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5880874] [2022-11-03 02:41:41,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5880874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:41,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:41,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784588332] [2022-11-03 02:41:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:41,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:41,135 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:41,302 INFO L93 Difference]: Finished difference Result 352 states and 490 transitions. [2022-11-03 02:41:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:41:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:41,305 INFO L225 Difference]: With dead ends: 352 [2022-11-03 02:41:41,305 INFO L226 Difference]: Without dead ends: 339 [2022-11-03 02:41:41,307 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:41:41,308 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 132 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:41,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 449 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-03 02:41:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 246. [2022-11-03 02:41:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.2553191489361701) internal successors, (236), 193 states have internal predecessors, (236), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-03 02:41:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 323 transitions. [2022-11-03 02:41:41,359 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 323 transitions. Word has length 25 [2022-11-03 02:41:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:41,359 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 323 transitions. [2022-11-03 02:41:41,359 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), 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:41:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 323 transitions. [2022-11-03 02:41:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:41:41,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:41,360 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] [2022-11-03 02:41:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:41:41,361 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1078281712, now seen corresponding path program 1 times [2022-11-03 02:41:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:41,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642435070] [2022-11-03 02:41:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:41,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:41,467 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:41:41,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642435070] [2022-11-03 02:41:41,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642435070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:41,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:41,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:41:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673854273] [2022-11-03 02:41:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:41,472 INFO L87 Difference]: Start difference. First operand 246 states and 323 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:41,582 INFO L93 Difference]: Finished difference Result 260 states and 337 transitions. [2022-11-03 02:41:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 02:41:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:41,585 INFO L225 Difference]: With dead ends: 260 [2022-11-03 02:41:41,585 INFO L226 Difference]: Without dead ends: 256 [2022-11-03 02:41:41,585 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:41:41,586 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 13 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:41,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 534 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-03 02:41:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2022-11-03 02:41:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 199 states have internal predecessors, (242), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-03 02:41:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 329 transitions. [2022-11-03 02:41:41,626 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 329 transitions. Word has length 26 [2022-11-03 02:41:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:41,626 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 329 transitions. [2022-11-03 02:41:41,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 329 transitions. [2022-11-03 02:41:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:41:41,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:41,628 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] [2022-11-03 02:41:41,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:41:41,628 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1078558542, now seen corresponding path program 1 times [2022-11-03 02:41:41,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:41,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766116627] [2022-11-03 02:41:41,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:41,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:41,705 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:41:41,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:41,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766116627] [2022-11-03 02:41:41,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766116627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:41,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:41,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556544582] [2022-11-03 02:41:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:41,707 INFO L87 Difference]: Start difference. First operand 252 states and 329 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:42,087 INFO L93 Difference]: Finished difference Result 347 states and 481 transitions. [2022-11-03 02:41:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 02:41:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:42,090 INFO L225 Difference]: With dead ends: 347 [2022-11-03 02:41:42,090 INFO L226 Difference]: Without dead ends: 327 [2022-11-03 02:41:42,090 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:41:42,091 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 297 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:42,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 377 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-03 02:41:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 240. [2022-11-03 02:41:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 182 states have (on average 1.2582417582417582) internal successors, (229), 187 states have internal predecessors, (229), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-03 02:41:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2022-11-03 02:41:42,135 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 26 [2022-11-03 02:41:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:42,136 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2022-11-03 02:41:42,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:41:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2022-11-03 02:41:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:41:42,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:42,137 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:41:42,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:41:42,137 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1736831101, now seen corresponding path program 1 times [2022-11-03 02:41:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:42,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230957942] [2022-11-03 02:41:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:42,324 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:41:42,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:42,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230957942] [2022-11-03 02:41:42,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230957942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:42,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:42,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:41:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740280208] [2022-11-03 02:41:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:41:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:41:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:41:42,326 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:42,545 INFO L93 Difference]: Finished difference Result 255 states and 331 transitions. [2022-11-03 02:41:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:41:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-03 02:41:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:42,547 INFO L225 Difference]: With dead ends: 255 [2022-11-03 02:41:42,547 INFO L226 Difference]: Without dead ends: 251 [2022-11-03 02:41:42,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:41:42,548 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 15 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:42,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1005 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-03 02:41:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2022-11-03 02:41:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 194 states have internal predecessors, (236), 43 states have call successors, (43), 16 states have call predecessors, (43), 14 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2022-11-03 02:41:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 323 transitions. [2022-11-03 02:41:42,601 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 323 transitions. Word has length 27 [2022-11-03 02:41:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:42,602 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 323 transitions. [2022-11-03 02:41:42,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 323 transitions. [2022-11-03 02:41:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:41:42,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:42,603 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:41:42,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:41:42,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1737107931, now seen corresponding path program 1 times [2022-11-03 02:41:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:42,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213612946] [2022-11-03 02:41:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:42,709 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:41:42,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213612946] [2022-11-03 02:41:42,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213612946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:42,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:42,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:42,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492093465] [2022-11-03 02:41:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:42,712 INFO L87 Difference]: Start difference. First operand 247 states and 323 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:43,069 INFO L93 Difference]: Finished difference Result 340 states and 472 transitions. [2022-11-03 02:41:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:43,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-03 02:41:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:43,072 INFO L225 Difference]: With dead ends: 340 [2022-11-03 02:41:43,072 INFO L226 Difference]: Without dead ends: 324 [2022-11-03 02:41:43,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:41:43,073 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 437 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:43,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 295 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-03 02:41:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 235. [2022-11-03 02:41:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.252808988764045) internal successors, (223), 183 states have internal predecessors, (223), 42 states have call successors, (42), 16 states have call predecessors, (42), 14 states have return successors, (43), 36 states have call predecessors, (43), 36 states have call successors, (43) [2022-11-03 02:41:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 308 transitions. [2022-11-03 02:41:43,120 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 308 transitions. Word has length 27 [2022-11-03 02:41:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:43,120 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 308 transitions. [2022-11-03 02:41:43,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 308 transitions. [2022-11-03 02:41:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:41:43,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:43,121 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:41:43,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:41:43,122 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1728736953, now seen corresponding path program 1 times [2022-11-03 02:41:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:43,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797813452] [2022-11-03 02:41:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:43,231 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:41:43,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797813452] [2022-11-03 02:41:43,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797813452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:43,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:43,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:41:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394081920] [2022-11-03 02:41:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:41:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:41:43,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:41:43,234 INFO L87 Difference]: Start difference. First operand 235 states and 308 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:43,403 INFO L93 Difference]: Finished difference Result 241 states and 313 transitions. [2022-11-03 02:41:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:41:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-03 02:41:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:43,405 INFO L225 Difference]: With dead ends: 241 [2022-11-03 02:41:43,406 INFO L226 Difference]: Without dead ends: 218 [2022-11-03 02:41:43,406 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:41:43,407 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:43,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 839 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-03 02:41:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-03 02:41:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.2699386503067485) internal successors, (207), 168 states have internal predecessors, (207), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (42), 35 states have call predecessors, (42), 35 states have call successors, (42) [2022-11-03 02:41:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2022-11-03 02:41:43,448 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 28 [2022-11-03 02:41:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:43,448 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2022-11-03 02:41:43,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2022-11-03 02:41:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:41:43,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:43,449 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:41:43,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:41:43,450 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1725917529, now seen corresponding path program 1 times [2022-11-03 02:41:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:43,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257127996] [2022-11-03 02:41:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:43,496 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:41:43,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:43,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257127996] [2022-11-03 02:41:43,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257127996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:43,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233650560] [2022-11-03 02:41:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:43,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:43,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:43,498 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:43,635 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2022-11-03 02:41:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:41:43,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-03 02:41:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:43,654 INFO L225 Difference]: With dead ends: 248 [2022-11-03 02:41:43,654 INFO L226 Difference]: Without dead ends: 216 [2022-11-03 02:41:43,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:43,655 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 34 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:43,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 657 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-03 02:41:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-03 02:41:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 167 states have internal predecessors, (204), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2022-11-03 02:41:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2022-11-03 02:41:43,696 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 28 [2022-11-03 02:41:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:43,696 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2022-11-03 02:41:43,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2022-11-03 02:41:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:41:43,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:43,697 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:41:43,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:41:43,698 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1931034124, now seen corresponding path program 1 times [2022-11-03 02:41:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033359138] [2022-11-03 02:41:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:43,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:41:43,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:43,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033359138] [2022-11-03 02:41:43,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033359138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:43,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:43,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400422818] [2022-11-03 02:41:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:43,766 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:43,869 INFO L93 Difference]: Finished difference Result 383 states and 527 transitions. [2022-11-03 02:41:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-03 02:41:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:43,873 INFO L225 Difference]: With dead ends: 383 [2022-11-03 02:41:43,873 INFO L226 Difference]: Without dead ends: 219 [2022-11-03 02:41:43,874 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:41:43,874 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:43,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-03 02:41:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-11-03 02:41:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 169 states have internal predecessors, (208), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (41), 34 states have call predecessors, (41), 34 states have call successors, (41) [2022-11-03 02:41:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2022-11-03 02:41:43,913 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 32 [2022-11-03 02:41:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:43,913 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2022-11-03 02:41:43,913 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2022-11-03 02:41:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:41:43,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:43,914 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:41:43,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:41:43,915 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 185455332, now seen corresponding path program 1 times [2022-11-03 02:41:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309012108] [2022-11-03 02:41:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:44,075 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:41:44,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309012108] [2022-11-03 02:41:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309012108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:44,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:41:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731061687] [2022-11-03 02:41:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:41:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:41:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:41:44,077 INFO L87 Difference]: Start difference. First operand 219 states and 289 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:44,273 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2022-11-03 02:41:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:41:44,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-03 02:41:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:44,274 INFO L225 Difference]: With dead ends: 221 [2022-11-03 02:41:44,275 INFO L226 Difference]: Without dead ends: 196 [2022-11-03 02:41:44,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:41:44,275 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 10 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:44,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 928 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-03 02:41:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-11-03 02:41:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.289655172413793) internal successors, (187), 148 states have internal predecessors, (187), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2022-11-03 02:41:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2022-11-03 02:41:44,310 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 32 [2022-11-03 02:41:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:44,310 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2022-11-03 02:41:44,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2022-11-03 02:41:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:41:44,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:44,311 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:41:44,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:41:44,312 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 438808505, now seen corresponding path program 1 times [2022-11-03 02:41:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:44,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165811390] [2022-11-03 02:41:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:44,347 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:41:44,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:44,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165811390] [2022-11-03 02:41:44,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165811390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:44,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:44,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607329682] [2022-11-03 02:41:44,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:44,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:44,350 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:44,484 INFO L93 Difference]: Finished difference Result 258 states and 355 transitions. [2022-11-03 02:41:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-03 02:41:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:44,486 INFO L225 Difference]: With dead ends: 258 [2022-11-03 02:41:44,487 INFO L226 Difference]: Without dead ends: 255 [2022-11-03 02:41:44,487 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:41:44,488 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 84 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:44,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 365 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-03 02:41:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 198. [2022-11-03 02:41:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 150 states have internal predecessors, (190), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2022-11-03 02:41:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2022-11-03 02:41:44,529 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 35 [2022-11-03 02:41:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:44,529 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2022-11-03 02:41:44,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2022-11-03 02:41:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:41:44,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:44,530 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:41:44,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:41:44,530 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1783499734, now seen corresponding path program 1 times [2022-11-03 02:41:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:44,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117500713] [2022-11-03 02:41:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:44,606 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:41:44,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117500713] [2022-11-03 02:41:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117500713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:44,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:44,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303068203] [2022-11-03 02:41:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:44,610 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:44,720 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2022-11-03 02:41:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:41:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-03 02:41:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:44,722 INFO L225 Difference]: With dead ends: 212 [2022-11-03 02:41:44,722 INFO L226 Difference]: Without dead ends: 184 [2022-11-03 02:41:44,722 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:41:44,723 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 23 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:44,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 601 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-03 02:41:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-11-03 02:41:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 138 states have internal predecessors, (176), 37 states have call successors, (37), 13 states have call predecessors, (37), 11 states have return successors, (39), 32 states have call predecessors, (39), 32 states have call successors, (39) [2022-11-03 02:41:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 252 transitions. [2022-11-03 02:41:44,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 252 transitions. Word has length 32 [2022-11-03 02:41:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:44,759 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 252 transitions. [2022-11-03 02:41:44,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 252 transitions. [2022-11-03 02:41:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:41:44,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:44,760 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:41:44,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:41:44,761 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash 480114929, now seen corresponding path program 1 times [2022-11-03 02:41:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:44,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638754499] [2022-11-03 02:41:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:44,816 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:41:44,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638754499] [2022-11-03 02:41:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638754499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:44,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301708279] [2022-11-03 02:41:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:44,819 INFO L87 Difference]: Start difference. First operand 184 states and 252 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:44,908 INFO L93 Difference]: Finished difference Result 416 states and 579 transitions. [2022-11-03 02:41:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 02:41:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:44,910 INFO L225 Difference]: With dead ends: 416 [2022-11-03 02:41:44,910 INFO L226 Difference]: Without dead ends: 250 [2022-11-03 02:41:44,911 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:41:44,912 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 243 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:41:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-03 02:41:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 223. [2022-11-03 02:41:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 164 states have internal predecessors, (214), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-11-03 02:41:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 308 transitions. [2022-11-03 02:41:44,964 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 308 transitions. Word has length 36 [2022-11-03 02:41:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 308 transitions. [2022-11-03 02:41:44,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:41:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 308 transitions. [2022-11-03 02:41:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:41:44,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:44,966 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:41:44,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 02:41:44,966 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1078882105, now seen corresponding path program 1 times [2022-11-03 02:41:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:44,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629475532] [2022-11-03 02:41:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:45,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:41:45,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629475532] [2022-11-03 02:41:45,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629475532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:45,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:45,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:41:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639053338] [2022-11-03 02:41:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:41:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:41:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:41:45,152 INFO L87 Difference]: Start difference. First operand 223 states and 308 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:41:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:45,273 INFO L93 Difference]: Finished difference Result 424 states and 598 transitions. [2022-11-03 02:41:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:41:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-03 02:41:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:45,274 INFO L225 Difference]: With dead ends: 424 [2022-11-03 02:41:45,275 INFO L226 Difference]: Without dead ends: 216 [2022-11-03 02:41:45,275 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:41:45,276 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 13 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:45,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 650 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-03 02:41:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-03 02:41:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 157 states have internal predecessors, (203), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-11-03 02:41:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 296 transitions. [2022-11-03 02:41:45,317 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 296 transitions. Word has length 37 [2022-11-03 02:41:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:45,317 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 296 transitions. [2022-11-03 02:41:45,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:41:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 296 transitions. [2022-11-03 02:41:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:41:45,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:45,318 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:41:45,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 02:41:45,319 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1864106336, now seen corresponding path program 1 times [2022-11-03 02:41:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:45,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736495820] [2022-11-03 02:41:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:45,392 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:41:45,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736495820] [2022-11-03 02:41:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736495820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:45,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:45,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571828258] [2022-11-03 02:41:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:45,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:45,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:45,395 INFO L87 Difference]: Start difference. First operand 216 states and 296 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:41:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:45,589 INFO L93 Difference]: Finished difference Result 417 states and 584 transitions. [2022-11-03 02:41:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:45,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-03 02:41:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:45,591 INFO L225 Difference]: With dead ends: 417 [2022-11-03 02:41:45,592 INFO L226 Difference]: Without dead ends: 216 [2022-11-03 02:41:45,592 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:41:45,593 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 143 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:45,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 283 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-03 02:41:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-03 02:41:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.270440251572327) internal successors, (202), 157 states have internal predecessors, (202), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-11-03 02:41:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2022-11-03 02:41:45,649 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 41 [2022-11-03 02:41:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:45,649 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2022-11-03 02:41:45,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:41:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2022-11-03 02:41:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:41:45,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:45,650 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:41:45,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 02:41:45,651 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 198602331, now seen corresponding path program 1 times [2022-11-03 02:41:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:45,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860714341] [2022-11-03 02:41:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:46,015 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:41:46,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:46,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860714341] [2022-11-03 02:41:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860714341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:46,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:46,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:41:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266841964] [2022-11-03 02:41:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:46,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:41:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:41:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:41:46,017 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:41:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:46,625 INFO L93 Difference]: Finished difference Result 246 states and 332 transitions. [2022-11-03 02:41:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-11-03 02:41:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:46,628 INFO L225 Difference]: With dead ends: 246 [2022-11-03 02:41:46,628 INFO L226 Difference]: Without dead ends: 242 [2022-11-03 02:41:46,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:41:46,629 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 273 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:46,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 481 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:41:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-03 02:41:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2022-11-03 02:41:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 161 states have internal predecessors, (205), 42 states have call successors, (42), 16 states have call predecessors, (42), 17 states have return successors, (55), 44 states have call predecessors, (55), 39 states have call successors, (55) [2022-11-03 02:41:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2022-11-03 02:41:46,678 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 42 [2022-11-03 02:41:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:46,679 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2022-11-03 02:41:46,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:41:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2022-11-03 02:41:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:41:46,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:46,680 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:41:46,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 02:41:46,680 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 959621875, now seen corresponding path program 1 times [2022-11-03 02:41:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:46,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539313401] [2022-11-03 02:41:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:46,878 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:41:46,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539313401] [2022-11-03 02:41:46,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539313401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:46,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:46,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:41:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966930323] [2022-11-03 02:41:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:46,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:41:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:41:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:41:46,880 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:41:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:47,274 INFO L93 Difference]: Finished difference Result 398 states and 541 transitions. [2022-11-03 02:41:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:41:47,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-11-03 02:41:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:47,276 INFO L225 Difference]: With dead ends: 398 [2022-11-03 02:41:47,276 INFO L226 Difference]: Without dead ends: 209 [2022-11-03 02:41:47,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:47,279 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:47,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 724 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-03 02:41:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-11-03 02:41:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.270967741935484) internal successors, (197), 153 states have internal predecessors, (197), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (45), 38 states have call predecessors, (45), 35 states have call successors, (45) [2022-11-03 02:41:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 280 transitions. [2022-11-03 02:41:47,338 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 280 transitions. Word has length 50 [2022-11-03 02:41:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:47,338 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 280 transitions. [2022-11-03 02:41:47,339 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:41:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 280 transitions. [2022-11-03 02:41:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 02:41:47,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:47,340 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] [2022-11-03 02:41:47,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 02:41:47,340 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1556211664, now seen corresponding path program 1 times [2022-11-03 02:41:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166915456] [2022-11-03 02:41:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:47,602 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:41:47,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166915456] [2022-11-03 02:41:47,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166915456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:47,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:47,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:41:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846127412] [2022-11-03 02:41:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:47,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:41:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:41:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:41:47,604 INFO L87 Difference]: Start difference. First operand 209 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:41:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:47,890 INFO L93 Difference]: Finished difference Result 226 states and 296 transitions. [2022-11-03 02:41:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:41:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-03 02:41:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:47,892 INFO L225 Difference]: With dead ends: 226 [2022-11-03 02:41:47,892 INFO L226 Difference]: Without dead ends: 207 [2022-11-03 02:41:47,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:41:47,893 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 40 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1154 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-03 02:41:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-03 02:41:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 152 states have internal predecessors, (196), 37 states have call successors, (37), 17 states have call predecessors, (37), 15 states have return successors, (43), 37 states have call predecessors, (43), 34 states have call successors, (43) [2022-11-03 02:41:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 276 transitions. [2022-11-03 02:41:47,931 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 276 transitions. Word has length 58 [2022-11-03 02:41:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:47,932 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 276 transitions. [2022-11-03 02:41:47,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:41:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 276 transitions. [2022-11-03 02:41:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-03 02:41:47,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:47,933 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] [2022-11-03 02:41:47,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 02:41:47,933 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1240794923, now seen corresponding path program 1 times [2022-11-03 02:41:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:47,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973667649] [2022-11-03 02:41:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:48,186 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:41:48,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:48,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973667649] [2022-11-03 02:41:48,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973667649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:48,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:48,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:41:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319561680] [2022-11-03 02:41:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:48,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:41:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:41:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:41:48,188 INFO L87 Difference]: Start difference. First operand 207 states and 276 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:48,482 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2022-11-03 02:41:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:41:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2022-11-03 02:41:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:48,484 INFO L225 Difference]: With dead ends: 318 [2022-11-03 02:41:48,485 INFO L226 Difference]: Without dead ends: 287 [2022-11-03 02:41:48,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:41:48,486 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 83 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:48,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1415 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-03 02:41:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 281. [2022-11-03 02:41:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 206 states have internal predecessors, (264), 58 states have call successors, (58), 17 states have call predecessors, (58), 15 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-03 02:41:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2022-11-03 02:41:48,537 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 63 [2022-11-03 02:41:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:48,537 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2022-11-03 02:41:48,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2022-11-03 02:41:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-03 02:41:48,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:48,544 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] [2022-11-03 02:41:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 02:41:48,544 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash -129726516, now seen corresponding path program 1 times [2022-11-03 02:41:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:48,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272682426] [2022-11-03 02:41:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:48,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:41:48,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:48,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272682426] [2022-11-03 02:41:48,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272682426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:48,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:48,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:41:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674693432] [2022-11-03 02:41:48,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:48,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:41:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:48,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:41:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:41:48,787 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 02:41:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:49,134 INFO L93 Difference]: Finished difference Result 303 states and 410 transitions. [2022-11-03 02:41:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:41:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-11-03 02:41:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:49,137 INFO L225 Difference]: With dead ends: 303 [2022-11-03 02:41:49,137 INFO L226 Difference]: Without dead ends: 278 [2022-11-03 02:41:49,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:41:49,138 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 170 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:49,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 982 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-03 02:41:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2022-11-03 02:41:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.2745098039215685) internal successors, (260), 203 states have internal predecessors, (260), 56 states have call successors, (56), 17 states have call predecessors, (56), 15 states have return successors, (67), 55 states have call predecessors, (67), 52 states have call successors, (67) [2022-11-03 02:41:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 383 transitions. [2022-11-03 02:41:49,204 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 383 transitions. Word has length 65 [2022-11-03 02:41:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:49,205 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 383 transitions. [2022-11-03 02:41:49,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 02:41:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 383 transitions. [2022-11-03 02:41:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 02:41:49,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:49,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:49,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 02:41:49,207 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1450914883, now seen corresponding path program 1 times [2022-11-03 02:41:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:49,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900688189] [2022-11-03 02:41:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:41:49,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:49,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900688189] [2022-11-03 02:41:49,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900688189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:49,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:49,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:41:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001076487] [2022-11-03 02:41:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:41:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:49,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:41:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:49,574 INFO L87 Difference]: Start difference. First operand 276 states and 383 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:50,050 INFO L93 Difference]: Finished difference Result 328 states and 449 transitions. [2022-11-03 02:41:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-11-03 02:41:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:50,053 INFO L225 Difference]: With dead ends: 328 [2022-11-03 02:41:50,053 INFO L226 Difference]: Without dead ends: 322 [2022-11-03 02:41:50,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:50,054 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 217 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:50,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 449 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-03 02:41:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 284. [2022-11-03 02:41:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 210 states have internal predecessors, (268), 58 states have call successors, (58), 18 states have call predecessors, (58), 16 states have return successors, (69), 55 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-03 02:41:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 395 transitions. [2022-11-03 02:41:50,107 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 395 transitions. Word has length 70 [2022-11-03 02:41:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:50,108 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 395 transitions. [2022-11-03 02:41:50,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 395 transitions. [2022-11-03 02:41:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 02:41:50,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:50,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:50,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 02:41:50,110 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1040518753, now seen corresponding path program 1 times [2022-11-03 02:41:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:50,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629706907] [2022-11-03 02:41:50,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:41:50,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629706907] [2022-11-03 02:41:50,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629706907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:50,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:41:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043111715] [2022-11-03 02:41:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:41:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:41:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:50,534 INFO L87 Difference]: Start difference. First operand 284 states and 395 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:51,069 INFO L93 Difference]: Finished difference Result 306 states and 419 transitions. [2022-11-03 02:41:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-11-03 02:41:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:51,072 INFO L225 Difference]: With dead ends: 306 [2022-11-03 02:41:51,072 INFO L226 Difference]: Without dead ends: 300 [2022-11-03 02:41:51,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:51,073 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 266 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:51,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 397 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-03 02:41:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 284. [2022-11-03 02:41:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 58 states have call successors, (58), 18 states have call predecessors, (58), 16 states have return successors, (69), 55 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-03 02:41:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2022-11-03 02:41:51,133 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 70 [2022-11-03 02:41:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:51,133 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2022-11-03 02:41:51,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 02:41:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2022-11-03 02:41:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 02:41:51,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:51,135 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] [2022-11-03 02:41:51,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 02:41:51,135 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1218407741, now seen corresponding path program 1 times [2022-11-03 02:41:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:51,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643403056] [2022-11-03 02:41:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:51,365 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:41:51,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:51,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643403056] [2022-11-03 02:41:51,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643403056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:51,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:51,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:41:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102439170] [2022-11-03 02:41:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:51,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:41:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:51,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:41:51,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:41:51,367 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 02:41:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:51,762 INFO L93 Difference]: Finished difference Result 293 states and 401 transitions. [2022-11-03 02:41:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:41:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-11-03 02:41:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:51,765 INFO L225 Difference]: With dead ends: 293 [2022-11-03 02:41:51,765 INFO L226 Difference]: Without dead ends: 252 [2022-11-03 02:41:51,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:41:51,766 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 256 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:51,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 970 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-03 02:41:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 162. [2022-11-03 02:41:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 117 states have internal predecessors, (134), 33 states have call successors, (33), 16 states have call predecessors, (33), 14 states have return successors, (37), 28 states have call predecessors, (37), 30 states have call successors, (37) [2022-11-03 02:41:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2022-11-03 02:41:51,807 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 70 [2022-11-03 02:41:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:51,807 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2022-11-03 02:41:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 02:41:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2022-11-03 02:41:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-03 02:41:51,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:51,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:51,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 02:41:51,809 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 761882567, now seen corresponding path program 1 times [2022-11-03 02:41:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:51,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023965231] [2022-11-03 02:41:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:41:51,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:51,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023965231] [2022-11-03 02:41:51,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023965231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:51,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:51,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:41:51,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848564037] [2022-11-03 02:41:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:51,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:51,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:51,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:41:51,907 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:41:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:52,117 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2022-11-03 02:41:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:41:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2022-11-03 02:41:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:52,119 INFO L225 Difference]: With dead ends: 283 [2022-11-03 02:41:52,119 INFO L226 Difference]: Without dead ends: 171 [2022-11-03 02:41:52,119 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:41:52,120 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:52,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 260 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-03 02:41:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2022-11-03 02:41:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 109 states have internal predecessors, (120), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 02:41:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-11-03 02:41:52,159 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 78 [2022-11-03 02:41:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:52,160 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-11-03 02:41:52,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:41:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-11-03 02:41:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 02:41:52,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:52,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:52,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 02:41:52,162 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1944861011, now seen corresponding path program 1 times [2022-11-03 02:41:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:52,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868976055] [2022-11-03 02:41:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-03 02:41:52,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:52,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868976055] [2022-11-03 02:41:52,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868976055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:52,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:52,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:41:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423796712] [2022-11-03 02:41:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:52,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:41:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:41:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:52,594 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:41:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:53,063 INFO L93 Difference]: Finished difference Result 186 states and 216 transitions. [2022-11-03 02:41:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-11-03 02:41:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:53,065 INFO L225 Difference]: With dead ends: 186 [2022-11-03 02:41:53,066 INFO L226 Difference]: Without dead ends: 179 [2022-11-03 02:41:53,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:53,067 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 272 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:53,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 279 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-03 02:41:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2022-11-03 02:41:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 110 states have internal predecessors, (121), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 02:41:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2022-11-03 02:41:53,119 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 99 [2022-11-03 02:41:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:53,120 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2022-11-03 02:41:53,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:41:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2022-11-03 02:41:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 02:41:53,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:53,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:53,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 02:41:53,124 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1535391636, now seen corresponding path program 1 times [2022-11-03 02:41:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:53,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521225727] [2022-11-03 02:41:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:41:53,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:53,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521225727] [2022-11-03 02:41:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521225727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:53,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:53,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629553099] [2022-11-03 02:41:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:53,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:53,194 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:41:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:53,259 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2022-11-03 02:41:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-11-03 02:41:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:53,261 INFO L225 Difference]: With dead ends: 157 [2022-11-03 02:41:53,261 INFO L226 Difference]: Without dead ends: 150 [2022-11-03 02:41:53,261 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:41:53,262 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:53,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:41:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-03 02:41:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-03 02:41:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 110 states have internal predecessors, (120), 28 states have call successors, (28), 18 states have call predecessors, (28), 14 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 02:41:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2022-11-03 02:41:53,301 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 99 [2022-11-03 02:41:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:53,302 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2022-11-03 02:41:53,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:41:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2022-11-03 02:41:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-03 02:41:53,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:53,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:53,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 02:41:53,304 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash 732312146, now seen corresponding path program 1 times [2022-11-03 02:41:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356255968] [2022-11-03 02:41:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-03 02:41:53,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:53,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356255968] [2022-11-03 02:41:53,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356255968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:53,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:53,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:41:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936414231] [2022-11-03 02:41:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:53,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:41:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:41:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:53,792 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:41:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:54,246 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2022-11-03 02:41:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-03 02:41:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:54,248 INFO L225 Difference]: With dead ends: 198 [2022-11-03 02:41:54,248 INFO L226 Difference]: Without dead ends: 190 [2022-11-03 02:41:54,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:54,249 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 158 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:54,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 287 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:41:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-03 02:41:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-11-03 02:41:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 110 states have internal predecessors, (118), 28 states have call successors, (28), 19 states have call predecessors, (28), 15 states have return successors, (25), 20 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 02:41:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2022-11-03 02:41:54,289 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 104 [2022-11-03 02:41:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:54,290 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2022-11-03 02:41:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:41:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2022-11-03 02:41:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-03 02:41:54,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:54,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:54,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 02:41:54,292 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1350939513, now seen corresponding path program 1 times [2022-11-03 02:41:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:54,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717594194] [2022-11-03 02:41:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 02:41:55,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717594194] [2022-11-03 02:41:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717594194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263645303] [2022-11-03 02:41:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:55,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:55,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:41:55,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:41:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:41:55,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:41:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-03 02:41:55,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:41:55,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263645303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:55,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:41:55,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-11-03 02:41:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182377260] [2022-11-03 02:41:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:55,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:41:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:41:55,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:41:55,562 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-03 02:41:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:55,850 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2022-11-03 02:41:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:41:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 126 [2022-11-03 02:41:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:55,852 INFO L225 Difference]: With dead ends: 186 [2022-11-03 02:41:55,852 INFO L226 Difference]: Without dead ends: 178 [2022-11-03 02:41:55,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:41:55,853 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 71 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:55,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 479 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-03 02:41:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 135. [2022-11-03 02:41:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 24 states have call successors, (24), 16 states have call predecessors, (24), 14 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-03 02:41:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2022-11-03 02:41:55,907 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 126 [2022-11-03 02:41:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:55,909 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2022-11-03 02:41:55,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-03 02:41:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2022-11-03 02:41:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-03 02:41:55,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:55,911 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:55,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:41:56,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:56,130 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2119651962, now seen corresponding path program 1 times [2022-11-03 02:41:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110096234] [2022-11-03 02:41:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-03 02:41:56,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110096234] [2022-11-03 02:41:56,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110096234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:56,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:56,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:41:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089764031] [2022-11-03 02:41:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:41:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:41:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:41:56,661 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:41:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:57,093 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2022-11-03 02:41:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:41:57,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2022-11-03 02:41:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:57,095 INFO L225 Difference]: With dead ends: 164 [2022-11-03 02:41:57,095 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:41:57,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:57,096 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 161 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:57,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 287 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:41:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:41:57,097 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:41:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:41:57,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2022-11-03 02:41:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:57,097 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:41:57,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:41:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:41:57,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:41:57,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:41:57,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 02:41:57,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:42:02,841 WARN L234 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 104 DAG size of output: 104 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:44:32,414 INFO L899 garLoopResultBuilder]: For program point IoBuildDeviceIoControlRequestEXIT(lines 834 858) no Hoare annotation was computed. [2022-11-03 02:44:32,415 INFO L895 garLoopResultBuilder]: At program point IoBuildDeviceIoControlRequestENTRY(lines 834 858) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (< 0 ~s~0)) (not (<= ~myStatus~0 0)) (= |old(~customIrp~0)| ~customIrp~0) (= ~pended~0 1) (not (<= ~s~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2022-11-03 02:44:32,415 INFO L895 garLoopResultBuilder]: At program point L987(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (<= ~myStatus~0 0))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 .cse2 (not (= |old(~customIrp~0)| 1)) .cse3 (and (= ~setEventCalled~0 1) (= ~customIrp~0 1) (= ~s~0 |old(~s~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,415 INFO L899 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 974 1015) no Hoare annotation was computed. [2022-11-03 02:44:32,416 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 998) no Hoare annotation was computed. [2022-11-03 02:44:32,416 INFO L895 garLoopResultBuilder]: At program point L994(line 994) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (<= ~myStatus~0 0))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 .cse1 .cse2 (not (= |old(~customIrp~0)| 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,416 INFO L899 garLoopResultBuilder]: For program point L992(lines 992 996) no Hoare annotation was computed. [2022-11-03 02:44:32,417 INFO L895 garLoopResultBuilder]: At program point L992-1(lines 979 998) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (<= ~myStatus~0 0))) (.cse3 (= ~pended~0 1)) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse7 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse10 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)) .cse9 .cse10 (not (= ~MPR3~0 |old(~s~0)|))) (let ((.cse11 (< 0 ~s~0)) (.cse12 (<= ~s~0 1))) (or .cse0 .cse1 .cse2 (not (= |old(~customIrp~0)| 1)) .cse3 (and (= ~setEventCalled~0 1) .cse11 .cse12) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 (= ~customIrp~0 1)))))) [2022-11-03 02:44:32,417 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 985) no Hoare annotation was computed. [2022-11-03 02:44:32,417 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 974 1015) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (<= ~myStatus~0 0))) (.cse4 (= ~setEventCalled~0 1)) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse3 (= ~pended~0 1)) (.cse6 (not (<= 4 ~SKIP2~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= ~routine~0 0))) (.cse9 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (= 2 ~DC~0))) (.cse11 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse12 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~customIrp~0)| 1)) .cse3 (and .cse4 (= ~customIrp~0 1) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 (and (= |old(~customIrp~0)| ~customIrp~0) .cse4 .cse5) .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-11-03 02:44:32,417 INFO L895 garLoopResultBuilder]: At program point L281(line 281) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= ~myStatus~0 0)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (let ((.cse0 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259))) (and (or (<= DiskPerfForwardIrpSynchronous_~status~3 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (not (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 258))) (= ~compRegistered~0 1) (or .cse0 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 DiskPerfForwardIrpSynchronous_~status~3)) (or (and .cse0 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (and (<= ~s~0 1) (<= ~NP~0 ~s~0))) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~MPR3~0 ~s~0))) (not (< 0 |old(~s~0)|)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2022-11-03 02:44:32,418 INFO L899 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2022-11-03 02:44:32,418 INFO L899 garLoopResultBuilder]: For program point L279(lines 279 284) no Hoare annotation was computed. [2022-11-03 02:44:32,418 INFO L899 garLoopResultBuilder]: For program point L279-2(lines 279 284) no Hoare annotation was computed. [2022-11-03 02:44:32,418 INFO L899 garLoopResultBuilder]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 237 288) no Hoare annotation was computed. [2022-11-03 02:44:32,418 INFO L895 garLoopResultBuilder]: At program point L275(line 275) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= ~myStatus~0 0))) (.cse2 (= |old(~pended~0)| 1)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= |old(~s~0)| 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= |old(~routine~0)| 0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse9 (not (= 2 ~DC~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (and (= ~compRegistered~0 1) (not (= ~pended~0 1)) (= ~routine~0 0) (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (= |old(~customIrp~0)| ~customIrp~0) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,419 INFO L899 garLoopResultBuilder]: For program point L275-1(line 275) no Hoare annotation was computed. [2022-11-03 02:44:32,419 INFO L895 garLoopResultBuilder]: At program point L259(line 259) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= ~myStatus~0 0)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2022-11-03 02:44:32,419 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 270) no Hoare annotation was computed. [2022-11-03 02:44:32,419 INFO L895 garLoopResultBuilder]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 237 288) the Hoare annotation is: (let ((.cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse1 (not (<= ~myStatus~0 0))) (.cse2 (= |old(~pended~0)| 1)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= |old(~s~0)| 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= |old(~routine~0)| 0))) (.cse8 (not (< 0 |old(~s~0)|))) (.cse9 (not (= 2 ~DC~0))) (.cse10 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (= ~NP~0 1)) .cse0 .cse1 .cse2 .cse3 (and (not (= ~pended~0 1)) (= ~routine~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (= |old(~customIrp~0)| ~customIrp~0) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,420 INFO L895 garLoopResultBuilder]: At program point L264(line 264) the Hoare annotation is: (or (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= ~myStatus~0 0)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~routine~0)| 0)) (not (< 0 |old(~s~0)|)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0))) [2022-11-03 02:44:32,420 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 269) no Hoare annotation was computed. [2022-11-03 02:44:32,420 INFO L899 garLoopResultBuilder]: For program point L262-1(lines 257 270) no Hoare annotation was computed. [2022-11-03 02:44:32,420 INFO L895 garLoopResultBuilder]: At program point L960(line 960) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= |old(~s~0)| 1))) (.cse3 (not (= ~routine~0 0))) (.cse4 (not (< 0 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0)) .cse1 .cse2 (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse3 .cse4 .cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 (= ~SKIP2~0 2) .cse2 (= ~IPC~0 2) .cse3 .cse4 .cse5))) [2022-11-03 02:44:32,421 INFO L899 garLoopResultBuilder]: For program point L960-1(lines 952 965) no Hoare annotation was computed. [2022-11-03 02:44:32,421 INFO L899 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2022-11-03 02:44:32,421 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 952 965) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= |old(~s~0)| 1))) (.cse3 (not (= ~routine~0 0))) (.cse4 (not (< 0 |old(~s~0)|))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (and (< 0 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) .cse1 (= ~SKIP2~0 2) .cse2 (= ~IPC~0 2) .cse3 .cse4 .cse5) (or .cse0 (not (<= (+ 2 ~NP~0) ~SKIP1~0)) .cse1 .cse2 (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse3 .cse4 .cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))))) [2022-11-03 02:44:32,421 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 952 965) no Hoare annotation was computed. [2022-11-03 02:44:32,421 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 52 59) the Hoare annotation is: true [2022-11-03 02:44:32,422 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 52 59) no Hoare annotation was computed. [2022-11-03 02:44:32,422 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-11-03 02:44:32,422 INFO L895 garLoopResultBuilder]: At program point L795(line 795) the Hoare annotation is: false [2022-11-03 02:44:32,422 INFO L895 garLoopResultBuilder]: At program point L630(lines 461 632) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2022-11-03 02:44:32,422 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 599) no Hoare annotation was computed. [2022-11-03 02:44:32,423 INFO L895 garLoopResultBuilder]: At program point L564(lines 564 565) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (.cse5 (not (= ~pended~0 1))) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~NP~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse12 (<= ~myStatus~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~customIrp~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0))) [2022-11-03 02:44:32,423 INFO L899 garLoopResultBuilder]: For program point L564-1(lines 564 565) no Hoare annotation was computed. [2022-11-03 02:44:32,423 INFO L895 garLoopResultBuilder]: At program point L1093(line 1093) the Hoare annotation is: false [2022-11-03 02:44:32,423 INFO L895 garLoopResultBuilder]: At program point L1093-1(lines 1072 1097) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2022-11-03 02:44:32,424 INFO L895 garLoopResultBuilder]: At program point L1028(line 1028) the Hoare annotation is: false [2022-11-03 02:44:32,424 INFO L899 garLoopResultBuilder]: For program point L1028-1(line 1028) no Hoare annotation was computed. [2022-11-03 02:44:32,424 INFO L895 garLoopResultBuilder]: At program point L831(lines 647 833) the Hoare annotation is: (= ~NP~0 1) [2022-11-03 02:44:32,424 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2022-11-03 02:44:32,424 INFO L895 garLoopResultBuilder]: At program point L105(lines 105 132) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,425 INFO L895 garLoopResultBuilder]: At program point L601(line 601) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0)) [2022-11-03 02:44:32,425 INFO L899 garLoopResultBuilder]: For program point L601-1(line 601) no Hoare annotation was computed. [2022-11-03 02:44:32,425 INFO L895 garLoopResultBuilder]: At program point L535(lines 535 536) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (.cse5 (not (= ~pended~0 1))) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~NP~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse12 (<= ~myStatus~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~customIrp~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0))) [2022-11-03 02:44:32,425 INFO L899 garLoopResultBuilder]: For program point L535-1(lines 535 536) no Hoare annotation was computed. [2022-11-03 02:44:32,425 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2022-11-03 02:44:32,425 INFO L899 garLoopResultBuilder]: For program point L1031-2(lines 1026 1036) no Hoare annotation was computed. [2022-11-03 02:44:32,426 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-11-03 02:44:32,426 INFO L895 garLoopResultBuilder]: At program point L404-2(lines 404 411) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,426 INFO L899 garLoopResultBuilder]: For program point L405(lines 404 411) no Hoare annotation was computed. [2022-11-03 02:44:32,426 INFO L895 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,426 INFO L895 garLoopResultBuilder]: At program point L207-1(line 207) the Hoare annotation is: (and (<= |ULTIMATE.start_DiskPerfSendToNextDriver_#t~ret23#1| ~lowerDriverReturn~0) (= 2 ~DC~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfSendToNextDriver_#t~ret23#1|) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2022-11-03 02:44:32,427 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 131) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,427 INFO L895 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: false [2022-11-03 02:44:32,427 INFO L899 garLoopResultBuilder]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2022-11-03 02:44:32,427 INFO L895 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0)) [2022-11-03 02:44:32,427 INFO L899 garLoopResultBuilder]: For program point L538(lines 538 540) no Hoare annotation was computed. [2022-11-03 02:44:32,428 INFO L899 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2022-11-03 02:44:32,428 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 610) no Hoare annotation was computed. [2022-11-03 02:44:32,428 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 526 624) no Hoare annotation was computed. [2022-11-03 02:44:32,428 INFO L895 garLoopResultBuilder]: At program point L1068(lines 1024 1099) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,429 INFO L895 garLoopResultBuilder]: At program point L804(lines 791 826) the Hoare annotation is: (let ((.cse5 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse9 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse0 (= ~s~0 ~DC~0)) (.cse1 (= 2 ~s~0)) (.cse6 (= 2 ~DC~0)) (.cse2 (not (= ~pended~0 1))) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse3 (= ~routine~0 0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~NP~0 1)) (.cse12 (= ~compRegistered~0 0)) (.cse11 (<= 4 ~SKIP2~0))) (let ((.cse14 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (.cse13 (or (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) .cse5 .cse6 .cse2 .cse7 .cse8 .cse3 .cse9 .cse10 (<= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| ~lowerDriverReturn~0) .cse4 .cse11 .cse12) (and (or (and .cse8 (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2 .cse7 .cse3 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse10 .cse4 .cse12))) (and .cse6 .cse2 .cse7 .cse8 .cse3 .cse10 .cse4 (= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) .cse12 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0))) .cse11))) (.cse15 (or (<= 260 |ULTIMATE.start_main_~status~6#1|) (<= |ULTIMATE.start_main_~status~6#1| 258))) (.cse16 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|)))) (or (and (not (= ~SKIP2~0 2)) .cse0 .cse1 (= |ULTIMATE.start_main_~status~6#1| 0) .cse2 (not (= ~IPC~0 2)) .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 (not .cse1) .cse8 .cse3 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse13 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0)) (and (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse14 .cse13 .cse15 .cse16) (and .cse14 .cse13 .cse15 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse16)))) [2022-11-03 02:44:32,429 INFO L895 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0)) [2022-11-03 02:44:32,429 INFO L899 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2022-11-03 02:44:32,429 INFO L895 garLoopResultBuilder]: At program point L508(lines 508 509) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (<= ~myStatus~0 0))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10))) (= ~NP~0 1)) [2022-11-03 02:44:32,430 INFO L899 garLoopResultBuilder]: For program point L508-1(lines 508 509) no Hoare annotation was computed. [2022-11-03 02:44:32,430 INFO L899 garLoopResultBuilder]: For program point L806(lines 806 810) no Hoare annotation was computed. [2022-11-03 02:44:32,430 INFO L895 garLoopResultBuilder]: At program point L707(lines 707 766) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,430 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2022-11-03 02:44:32,430 INFO L895 garLoopResultBuilder]: At program point L542(line 542) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0)) [2022-11-03 02:44:32,431 INFO L899 garLoopResultBuilder]: For program point L542-1(line 542) no Hoare annotation was computed. [2022-11-03 02:44:32,431 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,431 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-03 02:44:32,431 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 778) no Hoare annotation was computed. [2022-11-03 02:44:32,431 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2022-11-03 02:44:32,431 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: false [2022-11-03 02:44:32,432 INFO L895 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (or (= ~s~0 ~NP~0) (= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp32~0#1| 259))) [2022-11-03 02:44:32,432 INFO L899 garLoopResultBuilder]: For program point L577-1(line 577) no Hoare annotation was computed. [2022-11-03 02:44:32,432 INFO L899 garLoopResultBuilder]: For program point L511(lines 511 513) no Hoare annotation was computed. [2022-11-03 02:44:32,432 INFO L895 garLoopResultBuilder]: At program point L412(lines 403 413) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,432 INFO L895 garLoopResultBuilder]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~NP~0 1)) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~myStatus~0 0)) (and .cse0 (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,433 INFO L895 garLoopResultBuilder]: At program point L182-1(line 182) the Hoare annotation is: (and (= ~compRegistered~0 1) (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2022-11-03 02:44:32,433 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: false [2022-11-03 02:44:32,433 INFO L899 garLoopResultBuilder]: For program point L546(lines 546 551) no Hoare annotation was computed. [2022-11-03 02:44:32,433 INFO L899 garLoopResultBuilder]: For program point L546-2(lines 546 551) no Hoare annotation was computed. [2022-11-03 02:44:32,433 INFO L895 garLoopResultBuilder]: At program point L712(lines 712 765) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,434 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 1096) no Hoare annotation was computed. [2022-11-03 02:44:32,434 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 824) no Hoare annotation was computed. [2022-11-03 02:44:32,434 INFO L895 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (let ((.cse0 (and (< 0 ~s~0) (<= ~s~0 1)))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (or .cse0 (and (< 258 |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp27~0#1|) (<= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp27~0#1| 259))) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0)) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (or .cse0 (<= 259 |ULTIMATE.start_DiskPerfRegisterDevice_~status~5#1|)))) [2022-11-03 02:44:32,434 INFO L895 garLoopResultBuilder]: At program point L515(line 515) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0)) [2022-11-03 02:44:32,435 INFO L899 garLoopResultBuilder]: For program point L548-1(line 548) no Hoare annotation was computed. [2022-11-03 02:44:32,435 INFO L899 garLoopResultBuilder]: For program point L515-1(line 515) no Hoare annotation was computed. [2022-11-03 02:44:32,435 INFO L895 garLoopResultBuilder]: At program point L449(line 449) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,435 INFO L895 garLoopResultBuilder]: At program point L449-1(line 449) the Hoare annotation is: (and (<= |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret75#1| ~lowerDriverReturn~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~s~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfShutdownFlush_#t~ret75#1|) (= ~NP~0 1) (= ~IPC~0 ~s~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,435 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 02:44:32,435 INFO L899 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2022-11-03 02:44:32,436 INFO L895 garLoopResultBuilder]: At program point L780(lines 773 830) the Hoare annotation is: (let ((.cse20 (+ ~SKIP2~0 3))) (let ((.cse8 (= ~compRegistered~0 0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse11 (= ~s~0 ~DC~0)) (.cse12 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse20 ~IPC~0)) (.cse13 (not (= ~IPC~0 2))) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1))) (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse15 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (.cse16 (or (<= 260 |ULTIMATE.start_main_~status~6#1|) (<= |ULTIMATE.start_main_~status~6#1| 258))) (.cse17 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|))) (.cse14 (or (and .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse8) (and (= ~compRegistered~0 1) .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6))) (.cse18 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse0 (= 2 ~DC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse7 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0)) (and .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse13 .cse4 .cse6) (and .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse7 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse14) (and .cse15 .cse16 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse3 .cse17 .cse7 .cse14) (and (= ~s~0 ~UNLOADED~0) .cse6) (and .cse18 .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9) (and (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse15 .cse16 .cse3 .cse17 .cse7 .cse14) (and .cse18 .cse0 .cse1 (<= .cse20 ~s~0) .cse3 .cse4 .cse19 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8))))) [2022-11-03 02:44:32,436 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2022-11-03 02:44:32,436 INFO L895 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: false [2022-11-03 02:44:32,436 INFO L899 garLoopResultBuilder]: For program point L782(lines 782 786) no Hoare annotation was computed. [2022-11-03 02:44:32,437 INFO L895 garLoopResultBuilder]: At program point L683(lines 683 772) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~s~0 ~UNLOADED~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2022-11-03 02:44:32,437 INFO L899 garLoopResultBuilder]: For program point L683-1(lines 678 832) no Hoare annotation was computed. [2022-11-03 02:44:32,437 INFO L895 garLoopResultBuilder]: At program point L617(lines 613 622) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2022-11-03 02:44:32,437 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 227) no Hoare annotation was computed. [2022-11-03 02:44:32,437 INFO L895 garLoopResultBuilder]: At program point L717(lines 717 764) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point L519(lines 519 524) no Hoare annotation was computed. [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point L519-2(lines 501 631) no Hoare annotation was computed. [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 432) no Hoare annotation was computed. [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 418) no Hoare annotation was computed. [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point L388-2(lines 388 418) no Hoare annotation was computed. [2022-11-03 02:44:32,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:44:32,439 INFO L895 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,439 INFO L895 garLoopResultBuilder]: At program point L157-1(line 157) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (= ~routine~0 0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (<= ~myStatus~0 0))) (or (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_#t~ret12#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_#t~ret12#1| 258)) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_DiskPerfStartDevice_#t~ret12#1| 0)))) (= ~NP~0 1)) [2022-11-03 02:44:32,439 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (and (< 0 ~s~0) (<= ~s~0 1)))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= 2 ~DC~0) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~customIrp~0 1) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (or (and (<= |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp23~0#1| 259) (< 258 |ULTIMATE.start_DiskPerfRegisterDevice_~__cil_tmp23~0#1|)) .cse0) (<= 4 ~SKIP2~0) (<= ~myStatus~0 0) (or .cse0 (<= 259 |ULTIMATE.start_DiskPerfRegisterDevice_~status~5#1|)))) [2022-11-03 02:44:32,439 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2022-11-03 02:44:32,440 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (< 0 ~s~0)) (.cse1 (= 2 ~DC~0)) (.cse2 (<= ~s~0 1)) (.cse3 (not (= ~pended~0 1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 1073741789) 0)))) [2022-11-03 02:44:32,440 INFO L899 garLoopResultBuilder]: For program point L422-1(line 422) no Hoare annotation was computed. [2022-11-03 02:44:32,440 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2022-11-03 02:44:32,440 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 582) no Hoare annotation was computed. [2022-11-03 02:44:32,440 INFO L899 garLoopResultBuilder]: For program point L555-1(lines 526 624) no Hoare annotation was computed. [2022-11-03 02:44:32,440 INFO L895 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2022-11-03 02:44:32,440 INFO L899 garLoopResultBuilder]: For program point L225-1(lines 221 227) no Hoare annotation was computed. [2022-11-03 02:44:32,441 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: false [2022-11-03 02:44:32,441 INFO L895 garLoopResultBuilder]: At program point L788(lines 781 829) the Hoare annotation is: (let ((.cse20 (+ ~SKIP2~0 3))) (let ((.cse8 (= ~compRegistered~0 0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse11 (= ~s~0 ~DC~0)) (.cse12 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse20 ~IPC~0)) (.cse13 (not (= ~IPC~0 2))) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1))) (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse15 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (.cse16 (or (<= 260 |ULTIMATE.start_main_~status~6#1|) (<= |ULTIMATE.start_main_~status~6#1| 258))) (.cse17 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|))) (.cse14 (or (and .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse8) (and (= ~compRegistered~0 1) .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6))) (.cse18 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse0 (= 2 ~DC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse7 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0)) (and .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse13 .cse4 .cse6) (and .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse7 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse14) (and .cse15 .cse16 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse3 .cse17 .cse7 .cse14) (and (= ~s~0 ~UNLOADED~0) .cse6) (and .cse18 .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9) (and (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse15 .cse16 .cse3 .cse17 .cse7 .cse14) (and .cse18 .cse0 .cse1 (<= .cse20 ~s~0) .cse3 .cse4 .cse19 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8))))) [2022-11-03 02:44:32,441 INFO L895 garLoopResultBuilder]: At program point L722(lines 722 763) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,441 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 559) no Hoare annotation was computed. [2022-11-03 02:44:32,442 INFO L899 garLoopResultBuilder]: For program point L789(lines 773 830) no Hoare annotation was computed. [2022-11-03 02:44:32,442 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2022-11-03 02:44:32,442 INFO L895 garLoopResultBuilder]: At program point L162(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2022-11-03 02:44:32,442 INFO L895 garLoopResultBuilder]: At program point L162-1(line 162) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~s~0 ~DC~0) (= 2 ~s~0) (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0)) [2022-11-03 02:44:32,442 INFO L895 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~pended~0 1))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse6 (= ~routine~0 0)) (.cse7 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|))) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= ~NP~0 1)) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 02:44:32,443 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 827) no Hoare annotation was computed. [2022-11-03 02:44:32,443 INFO L899 garLoopResultBuilder]: For program point L526(lines 501 631) no Hoare annotation was computed. [2022-11-03 02:44:32,443 INFO L895 garLoopResultBuilder]: At program point L295(line 295) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~routine~0 0) (= ~NP~0 1) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,443 INFO L895 garLoopResultBuilder]: At program point L295-1(line 295) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~routine~0 0) (= ~NP~0 1) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,443 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 202) no Hoare annotation was computed. [2022-11-03 02:44:32,444 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1095) no Hoare annotation was computed. [2022-11-03 02:44:32,444 INFO L899 garLoopResultBuilder]: For program point L791(lines 791 826) no Hoare annotation was computed. [2022-11-03 02:44:32,444 INFO L895 garLoopResultBuilder]: At program point L593(lines 593 595) the Hoare annotation is: (and (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (< 0 ~s~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= ~s~0 1)) (.cse4 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258))) (.cse5 (not (= ~pended~0 1))) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (= ~routine~0 0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~NP~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse12 (<= ~myStatus~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~customIrp~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ~setEventCalled~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= |ULTIMATE.start_DiskPerfRegisterDevice_~output~0#1| 0))) [2022-11-03 02:44:32,444 INFO L899 garLoopResultBuilder]: For program point L593-1(lines 593 595) no Hoare annotation was computed. [2022-11-03 02:44:32,444 INFO L899 garLoopResultBuilder]: For program point L792(lines 792 802) no Hoare annotation was computed. [2022-11-03 02:44:32,444 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2022-11-03 02:44:32,445 INFO L895 garLoopResultBuilder]: At program point L429(line 429) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,445 INFO L899 garLoopResultBuilder]: For program point L429-1(line 429) no Hoare annotation was computed. [2022-11-03 02:44:32,445 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2022-11-03 02:44:32,445 INFO L895 garLoopResultBuilder]: At program point L760(lines 683 772) the Hoare annotation is: (let ((.cse20 (+ ~SKIP2~0 3))) (let ((.cse8 (= ~compRegistered~0 0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse11 (= ~s~0 ~DC~0)) (.cse12 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse20 ~IPC~0)) (.cse13 (not (= ~IPC~0 2))) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1))) (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse15 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (.cse16 (or (<= 260 |ULTIMATE.start_main_~status~6#1|) (<= |ULTIMATE.start_main_~status~6#1| 258))) (.cse17 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|))) (.cse14 (or (and .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse8) (and (= ~compRegistered~0 1) .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6))) (.cse18 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~6#1|)) (.cse0 (= 2 ~DC~0)) (.cse3 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (< |ULTIMATE.start_main_~status~6#1| (+ ~lowerDriverReturn~0 1))) (.cse7 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_PoCallDriver_~returnVal~0#1|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~status~6#1| ~lowerDriverReturn~0)) (and .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~status~6#1| 0) .cse1 .cse13 .cse4 .cse6) (and .cse3 (<= (+ |ULTIMATE.start_main_~status~6#1| 1073741789) 0) .cse7 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse14) (and .cse15 .cse16 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse3 .cse17 .cse7 .cse14) (and .cse18 .cse0 (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse1 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9) (and (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse15 .cse16 .cse3 .cse17 .cse7 .cse14) (and .cse18 .cse0 .cse1 (<= .cse20 ~s~0) .cse3 .cse4 .cse19 .cse5 .cse6 (= ~IPC~0 ~s~0) .cse7 .cse8))))) [2022-11-03 02:44:32,446 INFO L895 garLoopResultBuilder]: At program point L727(lines 727 762) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,446 INFO L895 garLoopResultBuilder]: At program point L397(line 397) the Hoare annotation is: (and (< 0 ~s~0) (= 2 ~DC~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,446 INFO L899 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2022-11-03 02:44:32,446 INFO L895 garLoopResultBuilder]: At program point L133(lines 96 135) the Hoare annotation is: (let ((.cse7 (= ~compRegistered~0 1)) (.cse8 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| 258))) (.cse9 (= ~s~0 ~DC~0)) (.cse10 (= 2 ~s~0)) (.cse0 (not (= ~pended~0 1))) (.cse1 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse2 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse3 (= ~routine~0 0)) (.cse11 (or (<= |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1| 258) (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_~status~0#1|))) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (<= 4 ~SKIP2~0))) (or (and (= 2 ~DC~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res#1|) .cse0 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res#1| ~lowerDriverReturn~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) (and .cse7 (or (<= 260 |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1|) (<= |ULTIMATE.start_DiskPerfRemoveDevice_~status~2#1| 258)) .cse8 .cse9 .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 (or (<= 260 |ULTIMATE.start_DiskPerfStartDevice_~status~1#1|) (<= |ULTIMATE.start_DiskPerfStartDevice_~status~1#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6))) [2022-11-03 02:44:32,446 INFO L899 garLoopResultBuilder]: For program point L1025(lines 1025 1045) no Hoare annotation was computed. [2022-11-03 02:44:32,447 INFO L895 garLoopResultBuilder]: At program point L1025-1(lines 1025 1045) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (= ~routine~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2022-11-03 02:44:32,447 INFO L895 garLoopResultBuilder]: At program point L431(lines 354 435) the Hoare annotation is: (let ((.cse1 (+ ~SKIP2~0 3))) (let ((.cse8 (= ~s~0 ~DC~0)) (.cse9 (= 2 ~s~0)) (.cse0 (not (= ~pended~0 1))) (.cse10 (<= .cse1 ~IPC~0)) (.cse2 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (<= 4 ~SKIP2~0)) (.cse7 (= ~compRegistered~0 0))) (or (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) (= 2 ~DC~0) .cse0 (<= .cse1 ~s~0) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| ~lowerDriverReturn~0) .cse5 (= ~IPC~0 ~s~0) .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_DiskPerfDeviceControl_~status~4#1| 0) (= |ULTIMATE.start_DiskPerfDeviceControl_#res#1| 0) .cse7) (and .cse8 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res#1|) 0) .cse7)))) [2022-11-03 02:44:32,447 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-11-03 02:44:32,447 INFO L899 garLoopResultBuilder]: For program point L200-1(lines 196 202) no Hoare annotation was computed. [2022-11-03 02:44:32,447 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1036) no Hoare annotation was computed. [2022-11-03 02:44:32,447 INFO L899 garLoopResultBuilder]: For program point L882(lines 882 890) no Hoare annotation was computed. [2022-11-03 02:44:32,448 INFO L899 garLoopResultBuilder]: For program point L882-2(lines 882 890) no Hoare annotation was computed. [2022-11-03 02:44:32,448 INFO L895 garLoopResultBuilder]: At program point L944(line 944) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse9 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse10 (not (< 0 |old(~s~0)|))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse0 .cse1 (not (<= ~myStatus~0 0)) .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8))) [2022-11-03 02:44:32,448 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 926 948) no Hoare annotation was computed. [2022-11-03 02:44:32,448 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse11 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse12 (not (< 0 |old(~s~0)|))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or (let ((.cse10 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse9 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse9 0) (not (= ~pended~0 1)) (<= 0 .cse10) (<= .cse10 0) (<= 0 .cse9) (= ~s~0 |old(~s~0)|))) .cse0 .cse1 (not (<= ~myStatus~0 0)) .cse3 .cse11 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8))) [2022-11-03 02:44:32,449 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 873 951) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~pended~0 1))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse3 (= |old(~pended~0)| 1)) (.cse10 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (= ~routine~0 0))) (.cse11 (not (< 0 |old(~s~0)|))) (.cse8 (not (= 2 ~DC~0))) (.cse9 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= ~SKIP1~0 ~s~0)) .cse6 .cse7 (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse9) (or .cse0 .cse1 (and (< 0 ~s~0) (<= ~s~0 1) .cse5) .cse2 .cse3 .cse10 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9) (or (and .cse5 (= ~s~0 |old(~s~0)|)) .cse0 .cse1 (not (<= ~myStatus~0 0)) .cse3 .cse10 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9 (not (= ~compRegistered~0 1))))) [2022-11-03 02:44:32,449 INFO L895 garLoopResultBuilder]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= |old(~pended~0)| 1)) (.cse9 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse10 (not (< 0 |old(~s~0)|))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse0 .cse1 (not (<= ~myStatus~0 0)) .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8))) [2022-11-03 02:44:32,449 INFO L899 garLoopResultBuilder]: For program point L888-1(line 888) no Hoare annotation was computed. [2022-11-03 02:44:32,449 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 873 951) no Hoare annotation was computed. [2022-11-03 02:44:32,450 INFO L895 garLoopResultBuilder]: At program point L884(line 884) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse3 (= |old(~pended~0)| 1)) (.cse9 (not (<= |old(~s~0)| 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (= ~routine~0 0))) (.cse10 (not (< 0 |old(~s~0)|))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8) (or (and (not (= ~pended~0 1)) (= ~s~0 |old(~s~0)|)) .cse0 .cse1 (not (<= ~myStatus~0 0)) .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 (not (= ~compRegistered~0 1))))) [2022-11-03 02:44:32,450 INFO L899 garLoopResultBuilder]: For program point L884-1(line 884) no Hoare annotation was computed. [2022-11-03 02:44:32,450 INFO L899 garLoopResultBuilder]: For program point L930(lines 930 947) no Hoare annotation was computed. [2022-11-03 02:44:32,450 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 897) no Hoare annotation was computed. [2022-11-03 02:44:32,450 INFO L895 garLoopResultBuilder]: At program point L922(lines 880 950) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse3 (not (= ~pended~0 1))) (.cse13 (not (= ~compRegistered~0 0))) (.cse5 (= |old(~pended~0)| 1)) (.cse6 (not (<= |old(~s~0)| 1))) (.cse7 (not (<= 4 ~SKIP2~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= ~routine~0 0))) (.cse10 (not (< 0 |old(~s~0)|))) (.cse11 (not (= 2 ~DC~0))) (.cse12 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= ~myStatus~0 0)) (let ((.cse4 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse2 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse2 0) .cse3 (<= 0 .cse4) (<= .cse4 0) (<= 0 .cse2) (= ~MPR1~0 ~s~0))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse13 .cse5 .cse7 (and .cse3 (= ~SKIP1~0 ~s~0)) .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12) (or .cse0 .cse1 (and (< 0 ~s~0) (<= ~s~0 1) .cse3) .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-03 02:44:32,451 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 899) no Hoare annotation was computed. [2022-11-03 02:44:32,451 INFO L895 garLoopResultBuilder]: At program point L881-1(lines 881 899) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~NP~0) ~SKIP1~0))) (.cse3 (not (= ~pended~0 1))) (.cse13 (not (= ~compRegistered~0 0))) (.cse5 (= |old(~pended~0)| 1)) (.cse6 (not (<= |old(~s~0)| 1))) (.cse7 (not (<= 4 ~SKIP2~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (= ~routine~0 0))) (.cse10 (not (< 0 |old(~s~0)|))) (.cse11 (not (= 2 ~DC~0))) (.cse12 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= ~myStatus~0 0)) (let ((.cse4 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse2 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~setEventCalled~0 1) (<= .cse2 0) .cse3 (<= 0 .cse4) (<= .cse4 0) (<= 0 .cse2) (= ~MPR1~0 ~s~0))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~compRegistered~0 1))) (or .cse0 .cse1 .cse13 .cse5 .cse7 (and .cse3 (= ~SKIP1~0 ~s~0)) .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12) (or .cse0 .cse1 (and (< 0 ~s~0) (<= ~s~0 1) .cse3) .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-03 02:44:32,451 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 946) no Hoare annotation was computed. [2022-11-03 02:44:32,451 INFO L899 garLoopResultBuilder]: For program point DiskPerfIrpCompletionEXIT(lines 136 146) no Hoare annotation was computed. [2022-11-03 02:44:32,451 INFO L902 garLoopResultBuilder]: At program point DiskPerfIrpCompletionENTRY(lines 136 146) the Hoare annotation is: true [2022-11-03 02:44:32,452 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 859 872) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= ~myStatus~0 0)) (= ~pended~0 1) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2022-11-03 02:44:32,452 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 859 872) no Hoare annotation was computed. [2022-11-03 02:44:32,452 INFO L895 garLoopResultBuilder]: At program point L867(line 867) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (<= (+ 2 ~NP~0) ~SKIP1~0)) (not (<= ~myStatus~0 0)) (= ~pended~0 1) (not (<= |old(~s~0)| 1)) (not (<= 4 ~SKIP2~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~routine~0 0)) (not (= ~setEventCalled~0 1)) (not (< 0 |old(~s~0)|)) (not (= 2 ~DC~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 1))) [2022-11-03 02:44:32,452 INFO L899 garLoopResultBuilder]: For program point L867-1(lines 859 872) no Hoare annotation was computed. [2022-11-03 02:44:32,452 INFO L899 garLoopResultBuilder]: For program point L318(lines 318 320) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 350) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L899 garLoopResultBuilder]: For program point DiskPerfIoCompletionFINAL(lines 300 353) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L902 garLoopResultBuilder]: At program point L346(line 346) the Hoare annotation is: true [2022-11-03 02:44:32,453 INFO L899 garLoopResultBuilder]: For program point L342(lines 342 348) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L899 garLoopResultBuilder]: For program point DiskPerfIoCompletionEXIT(lines 300 353) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 317 352) no Hoare annotation was computed. [2022-11-03 02:44:32,453 INFO L902 garLoopResultBuilder]: At program point DiskPerfIoCompletionENTRY(lines 300 353) the Hoare annotation is: true [2022-11-03 02:44:32,457 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] [2022-11-03 02:44:32,459 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:44:32,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:44:32 BoogieIcfgContainer [2022-11-03 02:44:32,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:44:32,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:44:32,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:44:32,517 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:44:32,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:35" (3/4) ... [2022-11-03 02:44:32,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:44:32,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2022-11-03 02:44:32,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-03 02:44:32,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2022-11-03 02:44:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-03 02:44:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-03 02:44:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-03 02:44:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2022-11-03 02:44:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-11-03 02:44:32,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2022-11-03 02:44:32,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2022-11-03 02:44:32,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-03 02:44:32,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:44:32,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-03 02:44:32,572 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) [2022-11-03 02:44:32,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) [2022-11-03 02:44:32,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || (((((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2)) && status + 1073741789 <= 0) && 1073741789 + \result <= 0)) || (((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2))) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status))) || (((((260 <= \result || \result <= 258) && (((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2))) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) [2022-11-03 02:44:32,574 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && 0 < s) && s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || ((0 < s && s <= 1) && customIrp == 1)) [2022-11-03 02:44:32,574 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) [2022-11-03 02:44:32,575 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((lowerDriverReturn <= \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status == 0) && \result == 0) && compRegistered == 0)) || ((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && 1073741789 + \result <= 0) && compRegistered == 0) [2022-11-03 02:44:32,576 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) [2022-11-03 02:44:32,576 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 == DC && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((((compRegistered == 1 && (260 <= status || status <= 258)) && (260 <= \result || \result <= 258)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2)) || ((((((((((((compRegistered == 1 && (260 <= \result || \result <= 258)) && s == DC) && 2 == s) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) [2022-11-03 02:44:32,577 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) [2022-11-03 02:44:32,577 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) [2022-11-03 02:44:32,578 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(0 < s)) || !(myStatus <= 0)) || \old(customIrp) == customIrp) || pended == 1) || !(s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) [2022-11-03 02:44:32,679 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:44:32,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:44:32,680 INFO L158 Benchmark]: Toolchain (without parser) took 179249.79ms. Allocated memory was 157.3MB in the beginning and 612.4MB in the end (delta: 455.1MB). Free memory was 122.4MB in the beginning and 325.3MB in the end (delta: -202.9MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,681 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:44:32,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.94ms. Allocated memory is still 157.3MB. Free memory was 122.1MB in the beginning and 122.3MB in the end (delta: -265.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.13ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 118.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,682 INFO L158 Benchmark]: Boogie Preprocessor took 49.06ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 115.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,682 INFO L158 Benchmark]: RCFGBuilder took 1434.33ms. Allocated memory is still 157.3MB. Free memory was 115.2MB in the beginning and 116.9MB in the end (delta: -1.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,682 INFO L158 Benchmark]: TraceAbstraction took 177011.34ms. Allocated memory was 157.3MB in the beginning and 612.4MB in the end (delta: 455.1MB). Free memory was 115.8MB in the beginning and 340.0MB in the end (delta: -224.2MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,683 INFO L158 Benchmark]: Witness Printer took 163.24ms. Allocated memory is still 612.4MB. Free memory was 340.0MB in the beginning and 325.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:44:32,684 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.94ms. Allocated memory is still 157.3MB. Free memory was 122.1MB in the beginning and 122.3MB in the end (delta: -265.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.13ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 118.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.06ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 115.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1434.33ms. Allocated memory is still 157.3MB. Free memory was 115.2MB in the beginning and 116.9MB in the end (delta: -1.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * TraceAbstraction took 177011.34ms. Allocated memory was 157.3MB in the beginning and 612.4MB in the end (delta: 455.1MB). Free memory was 115.8MB in the beginning and 340.0MB in the end (delta: -224.2MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. * Witness Printer took 163.24ms. Allocated memory is still 612.4MB. Free memory was 340.0MB in the beginning and 325.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 176.9s, OverallIterations: 42, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 155.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6357 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6273 mSDsluCounter, 20544 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15005 mSDsCounter, 732 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7491 IncrementalHoareTripleChecker+Invalid, 8223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 732 mSolverCounterUnsat, 7280 mSDtfsCounter, 7491 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 206 SyntacticMatches, 7 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=10, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 954 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 1350 PreInvPairs, 1527 NumberOfFragments, 7479 HoareAnnotationTreeSize, 1350 FomulaSimplifications, 17569 FormulaSimplificationTreeSizeReduction, 139.7s HoareSimplificationTime, 87 FomulaSimplificationsInter, 4558112 FormulaSimplificationTreeSizeReductionInter, 15.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1962 NumberOfCodeBlocks, 1962 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1919 ConstructedInterpolants, 0 QuantifiedInterpolants, 5131 SizeOfPredicates, 6 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 42 PerfectInterpolantSequences, 564/568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1072]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0 - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || (((((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2)) && status + 1073741789 <= 0) && 1073741789 + \result <= 0)) || (((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2))) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status))) || (((((260 <= \result || \result <= 258) && (((((((((((((lowerDriverReturn <= \result && lowerDriverReturn <= status) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) || (((2 + NP <= SKIP1 && ((((((((compRegistered == 1 && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) || (((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0))) || (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && compRegistered == 0) && status == lowerDriverReturn)) && 4 <= SKIP2))) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || (\old(customIrp) == customIrp && s == NP)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && 0 < s) && s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || ((0 < s && s <= 1) && customIrp == 1)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((2 == DC && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) || ((((((((((((compRegistered == 1 && (260 <= status || status <= 258)) && (260 <= \result || \result <= 258)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2)) || ((((((((((((compRegistered == 1 && (260 <= \result || \result <= 258)) && s == DC) && 2 == s) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && s == UNLOADED) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && s == DC) && 2 == s) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) || (((((((((((compRegistered == 1 && (260 <= status || status <= 258)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && s == DC) && 2 == s) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2 - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((compRegistered == 1 && setEventCalled == 1) && 0 < s) && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux || aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux <= 258)) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && myStatus <= 0) || (((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && myStatus <= 0) && aux-DiskPerfForwardIrpSynchronous(DeviceObject, Irp)-aux <= 0)) && NP == 1 - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || pended == 1) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && ((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || !(\old(customIrp) == 1)) || pended == 1) || ((setEventCalled == 1 && customIrp == 1) && s == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0 - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0 - InvariantResult [Line: 647]: Loop Invariant Derived loop invariant: NP == 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn <= \result && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) || (((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && status == 0) && \result == 0) && compRegistered == 0)) || ((((((((((s == DC && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && 1073741789 + \result <= 0) && compRegistered == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((((((((aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux <= lowerDriverReturn && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= aux-IofCallDriver(deviceExtension__TargetDeviceObject, Irp)-aux) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: (((((((((0 < s && 2 == DC) && s <= 1) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(0 < s)) || !(myStatus <= 0)) || \old(customIrp) == customIrp) || pended == 1) || !(s <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && myStatus <= 0) && compRegistered == 0 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: (((((((((((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == returnVal) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && status == lowerDriverReturn) || (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1)) || ((((2 + NP <= SKIP1 && status + 1073741789 <= 0) && 4 <= SKIP2) && 1073741789 + \result <= 0) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((260 <= \result || \result <= 258) && (260 <= status || status <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (s == UNLOADED && NP == 1)) || (((((((((((((lowerDriverReturn <= status && 2 == DC) && lowerDriverReturn <= \result) && !(pended == 1)) && \result <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s)) || (((((((260 <= status || status <= 258) && (260 <= \result || \result <= 258)) && (260 <= status || status <= 258)) && 2 + NP <= SKIP1) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && ((((((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && compRegistered == 0) || (((((((((compRegistered == 1 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((((lowerDriverReturn <= status && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= s) && 2 + NP <= SKIP1) && routine == 0) && status < lowerDriverReturn + 1) && SKIP1 + 2 <= MPR1) && NP == 1) && IPC == s) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 0 < s) && 2 == DC) && s <= 1) && (260 <= status || status <= 258)) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && (260 <= status || status <= 258)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && routine == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && NP == 1) && compRegistered == 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: (((((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(myStatus <= 0)) || ((((((setEventCalled == 1 && compRetStatus + 1073741802 <= 0) && !(pended == 1)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || !(compRegistered == 0)) || \old(pended) == 1) || !(4 <= SKIP2)) || (!(pended == 1) && SKIP1 == s)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(SKIP1 == \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC))) && (((((((((((!(NP == 1) || !(2 + NP <= SKIP1)) || ((0 < s && s <= 1) && !(pended == 1))) || !(compRegistered == 0)) || \old(pended) == 1) || !(\old(s) <= 1)) || !(4 <= SKIP2)) || !(SKIP1 + 2 <= MPR1)) || !(routine == 0)) || !(0 < \old(s))) || !(2 == DC)) || !(SKIP2 + 3 <= IPC)) RESULT: Ultimate proved your program to be correct! [2022-11-03 02:44:32,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f184c740-9c7d-4f24-8d49-5c0b2977d931/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE