./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.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_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/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_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/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_2f85abac-1258-44c4-987f-b0a991738578/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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 --- 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 03:53:47,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:53:47,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:53:47,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:53:47,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:53:47,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:53:47,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:53:47,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:53:47,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:53:47,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:53:47,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:53:47,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:53:47,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:53:47,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:53:47,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:53:47,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:53:47,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:53:47,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:53:47,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:53:47,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:53:47,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:53:47,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:53:47,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:53:47,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:53:47,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:53:47,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:53:47,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:53:47,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:53:47,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:53:47,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:53:47,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:53:47,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:53:47,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:53:47,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:53:47,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:53:47,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:53:47,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:53:47,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:53:47,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:53:47,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:53:47,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:53:47,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:53:47,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:53:47,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:53:47,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:53:47,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:53:47,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:53:47,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:53:47,330 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:53:47,330 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:53:47,330 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:53:47,331 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:53:47,332 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:53:47,332 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:53:47,333 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:53:47,333 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:53:47,333 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:53:47,334 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:53:47,334 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:53:47,334 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:53:47,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:53:47,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:53:47,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:53:47,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:53:47,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:53:47,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:53:47,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:53:47,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:53:47,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:53:47,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:53:47,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:53:47,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:53:47,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:53:47,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:53:47,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:53:47,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:53:47,341 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:53:47,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:53:47,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:53:47,342 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:53:47,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:53:47,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:53:47,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:53:47,343 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_2f85abac-1258-44c4-987f-b0a991738578/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_2f85abac-1258-44c4-987f-b0a991738578/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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2022-11-03 03:53:47,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:53:47,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:53:47,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:53:47,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:53:47,776 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:53:47,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-11-03 03:53:47,876 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/data/7871e992b/c927db4abfe0439cafc2d7e5ecfd97bf/FLAGea8954bc5 [2022-11-03 03:53:48,530 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:53:48,531 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-11-03 03:53:48,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/data/7871e992b/c927db4abfe0439cafc2d7e5ecfd97bf/FLAGea8954bc5 [2022-11-03 03:53:48,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/data/7871e992b/c927db4abfe0439cafc2d7e5ecfd97bf [2022-11-03 03:53:48,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:53:48,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:53:48,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:53:48,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:53:48,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:53:48,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:48" (1/1) ... [2022-11-03 03:53:48,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f769cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:48, skipping insertion in model container [2022-11-03 03:53:48,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:48" (1/1) ... [2022-11-03 03:53:48,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:53:48,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:53:49,122 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_2f85abac-1258-44c4-987f-b0a991738578/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-11-03 03:53:49,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:53:49,359 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:53:49,373 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_2f85abac-1258-44c4-987f-b0a991738578/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-11-03 03:53:49,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:53:49,495 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:53:49,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49 WrapperNode [2022-11-03 03:53:49,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:53:49,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:53:49,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:53:49,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:53:49,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,599 INFO L138 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1583 [2022-11-03 03:53:49,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:53:49,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:53:49,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:53:49,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:53:49,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:53:49,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:53:49,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:53:49,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:53:49,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:53:49,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:49,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:53:49,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:53:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-11-03 03:53:49,848 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-11-03 03:53:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:53:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-11-03 03:53:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-11-03 03:53:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-03 03:53:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-03 03:53:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-11-03 03:53:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-11-03 03:53:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-03 03:53:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-03 03:53:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 03:53:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 03:53:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-11-03 03:53:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-11-03 03:53:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-11-03 03:53:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-11-03 03:53:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-11-03 03:53:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-11-03 03:53:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 03:53:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 03:53:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:53:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 03:53:49,852 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 03:53:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-11-03 03:53:49,852 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-11-03 03:53:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:53:49,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:53:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-11-03 03:53:49,853 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-11-03 03:53:50,153 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:53:50,155 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:53:50,346 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,400 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-11-03 03:53:50,401 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-11-03 03:53:50,472 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,505 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-03 03:53:50,505 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-03 03:53:50,515 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,517 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,522 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,535 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,553 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,557 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:50,562 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 03:53:51,280 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-11-03 03:53:51,281 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-11-03 03:53:51,281 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-11-03 03:53:51,281 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-11-03 03:53:51,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-11-03 03:53:51,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-11-03 03:53:51,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-11-03 03:53:51,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-11-03 03:53:51,282 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-11-03 03:53:51,283 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-03 03:53:51,283 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-03 03:53:51,283 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-03 03:53:51,283 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-03 03:53:51,286 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-11-03 03:53:51,287 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-11-03 03:53:51,335 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:53:51,620 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:53:51,620 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:53:51,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51 BoogieIcfgContainer [2022-11-03 03:53:51,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:53:51,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:53:51,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:53:51,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:53:51,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:53:48" (1/3) ... [2022-11-03 03:53:51,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64893bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:51, skipping insertion in model container [2022-11-03 03:53:51,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (2/3) ... [2022-11-03 03:53:51,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64893bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:51, skipping insertion in model container [2022-11-03 03:53:51,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51" (3/3) ... [2022-11-03 03:53:51,633 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2022-11-03 03:53:51,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:53:51,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:53:51,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:53:51,723 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;@9141f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:53:51,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:53:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 248 states have (on average 1.5201612903225807) internal successors, (377), 267 states have internal predecessors, (377), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-11-03 03:53:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:53:51,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:51,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:51,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash 528378234, now seen corresponding path program 1 times [2022-11-03 03:53:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:51,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248851118] [2022-11-03 03:53:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:52,091 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 03:53:52,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248851118] [2022-11-03 03:53:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248851118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:52,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:52,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603954946] [2022-11-03 03:53:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:52,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:52,148 INFO L87 Difference]: Start difference. First operand has 350 states, 248 states have (on average 1.5201612903225807) internal successors, (377), 267 states have internal predecessors, (377), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:52,587 INFO L93 Difference]: Finished difference Result 669 states and 1082 transitions. [2022-11-03 03:53:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:53:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:52,605 INFO L225 Difference]: With dead ends: 669 [2022-11-03 03:53:52,605 INFO L226 Difference]: Without dead ends: 408 [2022-11-03 03:53:52,612 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 03:53:52,616 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 358 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:52,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 647 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:53:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-03 03:53:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 404. [2022-11-03 03:53:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 293 states have (on average 1.4505119453924915) internal successors, (425), 304 states have internal predecessors, (425), 92 states have call successors, (92), 21 states have call predecessors, (92), 18 states have return successors, (85), 80 states have call predecessors, (85), 80 states have call successors, (85) [2022-11-03 03:53:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 602 transitions. [2022-11-03 03:53:52,709 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 602 transitions. Word has length 9 [2022-11-03 03:53:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:52,709 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 602 transitions. [2022-11-03 03:53:52,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 602 transitions. [2022-11-03 03:53:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:53:52,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:52,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:52,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:53:52,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 963066728, now seen corresponding path program 1 times [2022-11-03 03:53:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747510135] [2022-11-03 03:53:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:52,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 03:53:52,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747510135] [2022-11-03 03:53:52,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747510135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:52,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:52,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110989500] [2022-11-03 03:53:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:52,894 INFO L87 Difference]: Start difference. First operand 404 states and 602 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:53,083 INFO L93 Difference]: Finished difference Result 580 states and 840 transitions. [2022-11-03 03:53:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 03:53:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:53,087 INFO L225 Difference]: With dead ends: 580 [2022-11-03 03:53:53,088 INFO L226 Difference]: Without dead ends: 494 [2022-11-03 03:53:53,089 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 03:53:53,090 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 447 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:53,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 560 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-11-03 03:53:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 464. [2022-11-03 03:53:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 344 states have (on average 1.430232558139535) internal successors, (492), 350 states have internal predecessors, (492), 93 states have call successors, (93), 26 states have call predecessors, (93), 26 states have return successors, (98), 87 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-03 03:53:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 683 transitions. [2022-11-03 03:53:53,132 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 683 transitions. Word has length 12 [2022-11-03 03:53:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:53,132 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 683 transitions. [2022-11-03 03:53:53,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 683 transitions. [2022-11-03 03:53:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:53:53,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:53,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:53,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:53:53,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:53,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1771491537, now seen corresponding path program 1 times [2022-11-03 03:53:53,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:53,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110735949] [2022-11-03 03:53:53,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:53,173 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 03:53:53,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110735949] [2022-11-03 03:53:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110735949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:53,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:53,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:53:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181087863] [2022-11-03 03:53:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:53,176 INFO L87 Difference]: Start difference. First operand 464 states and 683 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 03:53:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:53,379 INFO L93 Difference]: Finished difference Result 484 states and 709 transitions. [2022-11-03 03:53:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:53,380 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 03:53:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:53,387 INFO L225 Difference]: With dead ends: 484 [2022-11-03 03:53:53,387 INFO L226 Difference]: Without dead ends: 464 [2022-11-03 03:53:53,388 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 03:53:53,395 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 4 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:53,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 817 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:53:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-03 03:53:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2022-11-03 03:53:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 344 states have (on average 1.427325581395349) internal successors, (491), 350 states have internal predecessors, (491), 93 states have call successors, (93), 26 states have call predecessors, (93), 26 states have return successors, (98), 87 states have call predecessors, (98), 84 states have call successors, (98) [2022-11-03 03:53:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 682 transitions. [2022-11-03 03:53:53,470 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 682 transitions. Word has length 11 [2022-11-03 03:53:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:53,470 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 682 transitions. [2022-11-03 03:53:53,471 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 03:53:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 682 transitions. [2022-11-03 03:53:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:53:53,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:53,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:53,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:53:53,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1534164049, now seen corresponding path program 1 times [2022-11-03 03:53:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136029137] [2022-11-03 03:53:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:53,522 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 03:53:53,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:53,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136029137] [2022-11-03 03:53:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136029137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054182735] [2022-11-03 03:53:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:53,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:53,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:53,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:53,526 INFO L87 Difference]: Start difference. First operand 464 states and 682 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:53,891 INFO L93 Difference]: Finished difference Result 880 states and 1333 transitions. [2022-11-03 03:53:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:53:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:53,898 INFO L225 Difference]: With dead ends: 880 [2022-11-03 03:53:53,898 INFO L226 Difference]: Without dead ends: 711 [2022-11-03 03:53:53,899 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 03:53:53,901 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 231 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:53,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1024 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:53:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-03 03:53:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 591. [2022-11-03 03:53:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4243792325056432) internal successors, (631), 449 states have internal predecessors, (631), 110 states have call successors, (110), 38 states have call predecessors, (110), 37 states have return successors, (167), 103 states have call predecessors, (167), 101 states have call successors, (167) [2022-11-03 03:53:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 908 transitions. [2022-11-03 03:53:53,952 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 908 transitions. Word has length 15 [2022-11-03 03:53:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:53,953 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 908 transitions. [2022-11-03 03:53:53,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 908 transitions. [2022-11-03 03:53:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:53:53,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:53,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:53:53,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 75893357, now seen corresponding path program 1 times [2022-11-03 03:53:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:53,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828802177] [2022-11-03 03:53:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:54,118 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 03:53:54,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:54,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828802177] [2022-11-03 03:53:54,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828802177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:54,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:54,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992729792] [2022-11-03 03:53:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:54,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:54,123 INFO L87 Difference]: Start difference. First operand 591 states and 908 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:54,716 INFO L93 Difference]: Finished difference Result 973 states and 1491 transitions. [2022-11-03 03:53:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:54,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:53:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:54,722 INFO L225 Difference]: With dead ends: 973 [2022-11-03 03:53:54,723 INFO L226 Difference]: Without dead ends: 587 [2022-11-03 03:53:54,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:53:54,725 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 661 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:54,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 489 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:53:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-03 03:53:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 579. [2022-11-03 03:53:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 433 states have (on average 1.415704387990762) internal successors, (613), 439 states have internal predecessors, (613), 108 states have call successors, (108), 36 states have call predecessors, (108), 37 states have return successors, (163), 103 states have call predecessors, (163), 99 states have call successors, (163) [2022-11-03 03:53:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 884 transitions. [2022-11-03 03:53:54,790 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 884 transitions. Word has length 16 [2022-11-03 03:53:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:54,791 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 884 transitions. [2022-11-03 03:53:54,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 884 transitions. [2022-11-03 03:53:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:53:54,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:54,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:54,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:53:54,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1400788855, now seen corresponding path program 1 times [2022-11-03 03:53:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275833815] [2022-11-03 03:53:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:54,846 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 03:53:54,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:54,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275833815] [2022-11-03 03:53:54,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275833815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:54,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:54,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932300914] [2022-11-03 03:53:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:54,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:54,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:54,849 INFO L87 Difference]: Start difference. First operand 579 states and 884 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:55,076 INFO L93 Difference]: Finished difference Result 582 states and 886 transitions. [2022-11-03 03:53:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:53:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:55,080 INFO L225 Difference]: With dead ends: 582 [2022-11-03 03:53:55,080 INFO L226 Difference]: Without dead ends: 578 [2022-11-03 03:53:55,081 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 03:53:55,082 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 7 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:55,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 805 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:53:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-03 03:53:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-11-03 03:53:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 433 states have (on average 1.4110854503464203) internal successors, (611), 438 states have internal predecessors, (611), 107 states have call successors, (107), 36 states have call predecessors, (107), 37 states have return successors, (163), 103 states have call predecessors, (163), 99 states have call successors, (163) [2022-11-03 03:53:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 881 transitions. [2022-11-03 03:53:55,141 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 881 transitions. Word has length 15 [2022-11-03 03:53:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:55,142 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 881 transitions. [2022-11-03 03:53:55,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 881 transitions. [2022-11-03 03:53:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:53:55,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:55,145 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 03:53:55,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:53:55,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash -356824317, now seen corresponding path program 1 times [2022-11-03 03:53:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:55,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650206794] [2022-11-03 03:53:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:55,207 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 03:53:55,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650206794] [2022-11-03 03:53:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650206794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:55,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:55,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:53:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339187658] [2022-11-03 03:53:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:55,210 INFO L87 Difference]: Start difference. First operand 578 states and 881 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:55,531 INFO L93 Difference]: Finished difference Result 864 states and 1257 transitions. [2022-11-03 03:53:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:53:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 03:53:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:55,536 INFO L225 Difference]: With dead ends: 864 [2022-11-03 03:53:55,536 INFO L226 Difference]: Without dead ends: 575 [2022-11-03 03:53:55,537 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 03:53:55,538 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 222 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:55,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1258 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:53:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-03 03:53:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 482. [2022-11-03 03:53:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 358 states have (on average 1.388268156424581) internal successors, (497), 365 states have internal predecessors, (497), 92 states have call successors, (92), 32 states have call predecessors, (92), 31 states have return successors, (103), 84 states have call predecessors, (103), 84 states have call successors, (103) [2022-11-03 03:53:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 692 transitions. [2022-11-03 03:53:55,605 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 692 transitions. Word has length 21 [2022-11-03 03:53:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:55,605 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 692 transitions. [2022-11-03 03:53:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 692 transitions. [2022-11-03 03:53:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:53:55,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:55,608 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 03:53:55,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:53:55,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1485002027, now seen corresponding path program 1 times [2022-11-03 03:53:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:55,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287433183] [2022-11-03 03:53:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:55,715 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 03:53:55,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:55,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287433183] [2022-11-03 03:53:55,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287433183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:55,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:55,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746130548] [2022-11-03 03:53:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:55,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:55,717 INFO L87 Difference]: Start difference. First operand 482 states and 692 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:55,877 INFO L93 Difference]: Finished difference Result 539 states and 764 transitions. [2022-11-03 03:53:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 03:53:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:55,881 INFO L225 Difference]: With dead ends: 539 [2022-11-03 03:53:55,881 INFO L226 Difference]: Without dead ends: 519 [2022-11-03 03:53:55,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:55,882 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 460 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:55,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 457 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-03 03:53:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 510. [2022-11-03 03:53:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 383 states have (on average 1.3785900783289817) internal successors, (528), 389 states have internal predecessors, (528), 92 states have call successors, (92), 33 states have call predecessors, (92), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 03:53:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 726 transitions. [2022-11-03 03:53:55,936 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 726 transitions. Word has length 22 [2022-11-03 03:53:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:55,936 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 726 transitions. [2022-11-03 03:53:55,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 726 transitions. [2022-11-03 03:53:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:53:55,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:55,939 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 03:53:55,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:53:55,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2118189274, now seen corresponding path program 1 times [2022-11-03 03:53:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:55,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229194760] [2022-11-03 03:53:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:56,011 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 03:53:56,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229194760] [2022-11-03 03:53:56,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229194760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:56,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:56,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058068517] [2022-11-03 03:53:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:56,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:56,014 INFO L87 Difference]: Start difference. First operand 510 states and 726 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:56,558 INFO L93 Difference]: Finished difference Result 564 states and 795 transitions. [2022-11-03 03:53:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 03:53:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:56,562 INFO L225 Difference]: With dead ends: 564 [2022-11-03 03:53:56,562 INFO L226 Difference]: Without dead ends: 528 [2022-11-03 03:53:56,563 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 03:53:56,564 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 504 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:56,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 659 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:53:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-03 03:53:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 510. [2022-11-03 03:53:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 383 states have (on average 1.3733681462140992) internal successors, (526), 389 states have internal predecessors, (526), 92 states have call successors, (92), 33 states have call predecessors, (92), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 03:53:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 724 transitions. [2022-11-03 03:53:56,626 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 724 transitions. Word has length 22 [2022-11-03 03:53:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:56,626 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 724 transitions. [2022-11-03 03:53:56,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 724 transitions. [2022-11-03 03:53:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:53:56,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:56,629 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 03:53:56,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:53:56,629 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 385056216, now seen corresponding path program 1 times [2022-11-03 03:53:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:56,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62487163] [2022-11-03 03:53:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:56,684 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 03:53:56,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62487163] [2022-11-03 03:53:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62487163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:56,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146973592] [2022-11-03 03:53:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:56,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:56,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:56,686 INFO L87 Difference]: Start difference. First operand 510 states and 724 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:57,165 INFO L93 Difference]: Finished difference Result 546 states and 770 transitions. [2022-11-03 03:53:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:57,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:53:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:57,169 INFO L225 Difference]: With dead ends: 546 [2022-11-03 03:53:57,169 INFO L226 Difference]: Without dead ends: 510 [2022-11-03 03:53:57,170 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 03:53:57,170 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 488 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:57,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 654 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:53:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-03 03:53:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-03 03:53:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 383 states have (on average 1.3681462140992167) internal successors, (524), 389 states have internal predecessors, (524), 92 states have call successors, (92), 33 states have call predecessors, (92), 34 states have return successors, (106), 87 states have call predecessors, (106), 85 states have call successors, (106) [2022-11-03 03:53:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 722 transitions. [2022-11-03 03:53:57,229 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 722 transitions. Word has length 23 [2022-11-03 03:53:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:57,230 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 722 transitions. [2022-11-03 03:53:57,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 722 transitions. [2022-11-03 03:53:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:53:57,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:57,232 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 03:53:57,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:53:57,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1534881685, now seen corresponding path program 1 times [2022-11-03 03:53:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:57,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33300780] [2022-11-03 03:53:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:57,266 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 03:53:57,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33300780] [2022-11-03 03:53:57,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33300780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:57,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:57,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190665090] [2022-11-03 03:53:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:57,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:57,269 INFO L87 Difference]: Start difference. First operand 510 states and 722 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:57,526 INFO L93 Difference]: Finished difference Result 635 states and 893 transitions. [2022-11-03 03:53:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:57,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:53:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:57,530 INFO L225 Difference]: With dead ends: 635 [2022-11-03 03:53:57,531 INFO L226 Difference]: Without dead ends: 619 [2022-11-03 03:53:57,531 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 03:53:57,532 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 101 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:57,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 848 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:53:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-03 03:53:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 536. [2022-11-03 03:53:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 92 states have call successors, (92), 33 states have call predecessors, (92), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 03:53:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 749 transitions. [2022-11-03 03:53:57,598 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 749 transitions. Word has length 24 [2022-11-03 03:53:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:57,599 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 749 transitions. [2022-11-03 03:53:57,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 749 transitions. [2022-11-03 03:53:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:53:57,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:57,601 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 03:53:57,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:53:57,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 868592858, now seen corresponding path program 1 times [2022-11-03 03:53:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:57,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368695921] [2022-11-03 03:53:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:57,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 03:53:57,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368695921] [2022-11-03 03:53:57,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368695921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:57,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:57,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404526995] [2022-11-03 03:53:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:57,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:57,644 INFO L87 Difference]: Start difference. First operand 536 states and 749 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:57,854 INFO L93 Difference]: Finished difference Result 737 states and 1019 transitions. [2022-11-03 03:53:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-03 03:53:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:57,857 INFO L225 Difference]: With dead ends: 737 [2022-11-03 03:53:57,858 INFO L226 Difference]: Without dead ends: 582 [2022-11-03 03:53:57,858 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 03:53:57,859 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 115 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:57,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 835 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-03 03:53:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 536. [2022-11-03 03:53:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 407 states have (on average 1.3464373464373465) internal successors, (548), 413 states have internal predecessors, (548), 92 states have call successors, (92), 33 states have call predecessors, (92), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 03:53:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 747 transitions. [2022-11-03 03:53:57,922 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 747 transitions. Word has length 28 [2022-11-03 03:53:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:57,923 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 747 transitions. [2022-11-03 03:53:57,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 747 transitions. [2022-11-03 03:53:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:53:57,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:57,925 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 03:53:57,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:53:57,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash 781192337, now seen corresponding path program 1 times [2022-11-03 03:53:57,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:57,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033741948] [2022-11-03 03:53:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:53:58,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:58,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033741948] [2022-11-03 03:53:58,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033741948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:58,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:58,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709522090] [2022-11-03 03:53:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:58,007 INFO L87 Difference]: Start difference. First operand 536 states and 747 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 03:53:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:58,596 INFO L93 Difference]: Finished difference Result 615 states and 863 transitions. [2022-11-03 03:53:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:58,596 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 03:53:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:58,601 INFO L225 Difference]: With dead ends: 615 [2022-11-03 03:53:58,601 INFO L226 Difference]: Without dead ends: 611 [2022-11-03 03:53:58,602 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 03:53:58,603 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 551 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:58,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 700 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:53:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-03 03:53:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 539. [2022-11-03 03:53:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 410 states have (on average 1.3463414634146342) internal successors, (552), 416 states have internal predecessors, (552), 92 states have call successors, (92), 33 states have call predecessors, (92), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 03:53:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 751 transitions. [2022-11-03 03:53:58,678 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 751 transitions. Word has length 25 [2022-11-03 03:53:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:58,678 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 751 transitions. [2022-11-03 03:53:58,679 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 03:53:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 751 transitions. [2022-11-03 03:53:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:53:58,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:58,682 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 03:53:58,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:53:58,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 781469167, now seen corresponding path program 1 times [2022-11-03 03:53:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947361218] [2022-11-03 03:53:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:58,812 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 03:53:58,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:58,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947361218] [2022-11-03 03:53:58,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947361218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:58,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:58,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:53:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451254434] [2022-11-03 03:53:58,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:58,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:58,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:58,814 INFO L87 Difference]: Start difference. First operand 539 states and 751 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:59,038 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2022-11-03 03:53:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 03:53:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:59,042 INFO L225 Difference]: With dead ends: 551 [2022-11-03 03:53:59,042 INFO L226 Difference]: Without dead ends: 530 [2022-11-03 03:53:59,043 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 03:53:59,043 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 9 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:59,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1248 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-03 03:53:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-03 03:53:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 401 states have (on average 1.3516209476309227) internal successors, (542), 407 states have internal predecessors, (542), 92 states have call successors, (92), 33 states have call predecessors, (92), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 03:53:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 741 transitions. [2022-11-03 03:53:59,147 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 741 transitions. Word has length 25 [2022-11-03 03:53:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 741 transitions. [2022-11-03 03:53:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 741 transitions. [2022-11-03 03:53:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:53:59,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:59,150 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 03:53:59,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:53:59,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1242910421, now seen corresponding path program 1 times [2022-11-03 03:53:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:59,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252715689] [2022-11-03 03:53:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,195 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 03:53:59,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252715689] [2022-11-03 03:53:59,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252715689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291714078] [2022-11-03 03:53:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:59,198 INFO L87 Difference]: Start difference. First operand 530 states and 741 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:59,408 INFO L93 Difference]: Finished difference Result 553 states and 767 transitions. [2022-11-03 03:53:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-03 03:53:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:59,412 INFO L225 Difference]: With dead ends: 553 [2022-11-03 03:53:59,412 INFO L226 Difference]: Without dead ends: 546 [2022-11-03 03:53:59,413 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 03:53:59,413 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 60 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:59,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 748 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-03 03:53:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2022-11-03 03:53:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 413 states have (on average 1.3462469733656175) internal successors, (556), 419 states have internal predecessors, (556), 92 states have call successors, (92), 33 states have call predecessors, (92), 36 states have return successors, (107), 89 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 03:53:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 755 transitions. [2022-11-03 03:53:59,480 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 755 transitions. Word has length 27 [2022-11-03 03:53:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:59,480 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 755 transitions. [2022-11-03 03:53:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 755 transitions. [2022-11-03 03:53:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:53:59,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:59,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:59,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:53:59,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1005413810, now seen corresponding path program 1 times [2022-11-03 03:53:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:59,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470016614] [2022-11-03 03:53:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,512 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 03:53:59,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470016614] [2022-11-03 03:53:59,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470016614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003156571] [2022-11-03 03:53:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:59,515 INFO L87 Difference]: Start difference. First operand 542 states and 755 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:59,689 INFO L93 Difference]: Finished difference Result 607 states and 827 transitions. [2022-11-03 03:53:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:59,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 03:53:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:59,692 INFO L225 Difference]: With dead ends: 607 [2022-11-03 03:53:59,693 INFO L226 Difference]: Without dead ends: 548 [2022-11-03 03:53:59,693 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 03:53:59,694 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 409 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:59,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 514 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-03 03:53:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 533. [2022-11-03 03:53:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 408 states have (on average 1.3455882352941178) internal successors, (549), 414 states have internal predecessors, (549), 90 states have call successors, (90), 31 states have call predecessors, (90), 34 states have return successors, (105), 87 states have call predecessors, (105), 83 states have call successors, (105) [2022-11-03 03:53:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 744 transitions. [2022-11-03 03:53:59,770 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 744 transitions. Word has length 29 [2022-11-03 03:53:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:59,770 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 744 transitions. [2022-11-03 03:53:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:53:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 744 transitions. [2022-11-03 03:53:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:53:59,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:59,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:59,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 03:53:59,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:53:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -172506224, now seen corresponding path program 1 times [2022-11-03 03:53:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58479794] [2022-11-03 03:53:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,861 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 03:53:59,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58479794] [2022-11-03 03:53:59,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58479794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:53:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184189096] [2022-11-03 03:53:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:53:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:53:59,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:53:59,864 INFO L87 Difference]: Start difference. First operand 533 states and 744 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:00,451 INFO L93 Difference]: Finished difference Result 543 states and 752 transitions. [2022-11-03 03:54:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:54:00,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 03:54:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:00,455 INFO L225 Difference]: With dead ends: 543 [2022-11-03 03:54:00,456 INFO L226 Difference]: Without dead ends: 537 [2022-11-03 03:54:00,456 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 03:54:00,457 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 532 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:00,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 842 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:54:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-03 03:54:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2022-11-03 03:54:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 408 states have (on average 1.3431372549019607) internal successors, (548), 414 states have internal predecessors, (548), 90 states have call successors, (90), 31 states have call predecessors, (90), 34 states have return successors, (105), 87 states have call predecessors, (105), 83 states have call successors, (105) [2022-11-03 03:54:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 743 transitions. [2022-11-03 03:54:00,565 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 743 transitions. Word has length 29 [2022-11-03 03:54:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:00,565 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 743 transitions. [2022-11-03 03:54:00,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 743 transitions. [2022-11-03 03:54:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:54:00,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:00,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:00,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 03:54:00,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -739667452, now seen corresponding path program 1 times [2022-11-03 03:54:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501481168] [2022-11-03 03:54:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:00,676 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 03:54:00,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501481168] [2022-11-03 03:54:00,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501481168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:00,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:00,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:54:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110500831] [2022-11-03 03:54:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:00,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:00,678 INFO L87 Difference]: Start difference. First operand 533 states and 743 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:01,158 INFO L93 Difference]: Finished difference Result 552 states and 762 transitions. [2022-11-03 03:54:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:01,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-03 03:54:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:01,161 INFO L225 Difference]: With dead ends: 552 [2022-11-03 03:54:01,162 INFO L226 Difference]: Without dead ends: 528 [2022-11-03 03:54:01,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:01,163 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 38 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:01,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2001 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-03 03:54:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-11-03 03:54:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 405 states have (on average 1.3209876543209877) internal successors, (535), 411 states have internal predecessors, (535), 88 states have call successors, (88), 31 states have call predecessors, (88), 34 states have return successors, (103), 85 states have call predecessors, (103), 81 states have call successors, (103) [2022-11-03 03:54:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 726 transitions. [2022-11-03 03:54:01,232 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 726 transitions. Word has length 30 [2022-11-03 03:54:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:01,232 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 726 transitions. [2022-11-03 03:54:01,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 726 transitions. [2022-11-03 03:54:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:54:01,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:01,235 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 03:54:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:54:01,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -392993176, now seen corresponding path program 1 times [2022-11-03 03:54:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:01,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496534657] [2022-11-03 03:54:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:01,488 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 03:54:01,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496534657] [2022-11-03 03:54:01,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496534657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:01,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:01,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465104551] [2022-11-03 03:54:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:01,491 INFO L87 Difference]: Start difference. First operand 528 states and 726 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:02,060 INFO L93 Difference]: Finished difference Result 560 states and 758 transitions. [2022-11-03 03:54:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-03 03:54:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:02,070 INFO L225 Difference]: With dead ends: 560 [2022-11-03 03:54:02,070 INFO L226 Difference]: Without dead ends: 542 [2022-11-03 03:54:02,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:02,071 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 41 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:02,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3067 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-03 03:54:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 526. [2022-11-03 03:54:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 404 states have (on average 1.3193069306930694) internal successors, (533), 410 states have internal predecessors, (533), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (102), 84 states have call predecessors, (102), 80 states have call successors, (102) [2022-11-03 03:54:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 722 transitions. [2022-11-03 03:54:02,136 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 722 transitions. Word has length 35 [2022-11-03 03:54:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:02,136 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 722 transitions. [2022-11-03 03:54:02,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 722 transitions. [2022-11-03 03:54:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 03:54:02,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:02,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:02,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 03:54:02,139 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:02,140 INFO L85 PathProgramCache]: Analyzing trace with hash 866329192, now seen corresponding path program 1 times [2022-11-03 03:54:02,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:02,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264154782] [2022-11-03 03:54:02,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:02,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:02,330 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 03:54:02,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:02,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264154782] [2022-11-03 03:54:02,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264154782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:02,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:02,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072505567] [2022-11-03 03:54:02,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:02,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:02,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:02,333 INFO L87 Difference]: Start difference. First operand 526 states and 722 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:02,898 INFO L93 Difference]: Finished difference Result 558 states and 754 transitions. [2022-11-03 03:54:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-03 03:54:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:02,902 INFO L225 Difference]: With dead ends: 558 [2022-11-03 03:54:02,903 INFO L226 Difference]: Without dead ends: 539 [2022-11-03 03:54:02,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:02,904 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 50 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:02,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3062 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-03 03:54:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 525. [2022-11-03 03:54:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 403 states have (on average 1.2952853598014888) internal successors, (522), 409 states have internal predecessors, (522), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (102), 84 states have call predecessors, (102), 80 states have call successors, (102) [2022-11-03 03:54:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 711 transitions. [2022-11-03 03:54:02,976 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 711 transitions. Word has length 33 [2022-11-03 03:54:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:02,976 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 711 transitions. [2022-11-03 03:54:02,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 711 transitions. [2022-11-03 03:54:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 03:54:02,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:02,979 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 03:54:02,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 03:54:02,979 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1620249645, now seen corresponding path program 1 times [2022-11-03 03:54:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6270586] [2022-11-03 03:54:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:02,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:03,014 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 03:54:03,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:03,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6270586] [2022-11-03 03:54:03,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6270586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:03,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:03,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:54:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696423017] [2022-11-03 03:54:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:03,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:54:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:03,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:54:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:54:03,017 INFO L87 Difference]: Start difference. First operand 525 states and 711 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:03,402 INFO L93 Difference]: Finished difference Result 579 states and 767 transitions. [2022-11-03 03:54:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:54:03,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-03 03:54:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:03,406 INFO L225 Difference]: With dead ends: 579 [2022-11-03 03:54:03,406 INFO L226 Difference]: Without dead ends: 551 [2022-11-03 03:54:03,407 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 03:54:03,407 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 479 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:03,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 695 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-11-03 03:54:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 525. [2022-11-03 03:54:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 403 states have (on average 1.2928039702233252) internal successors, (521), 409 states have internal predecessors, (521), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (102), 84 states have call predecessors, (102), 80 states have call successors, (102) [2022-11-03 03:54:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 710 transitions. [2022-11-03 03:54:03,476 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 710 transitions. Word has length 32 [2022-11-03 03:54:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:03,476 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 710 transitions. [2022-11-03 03:54:03,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 710 transitions. [2022-11-03 03:54:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:54:03,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:03,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:03,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 03:54:03,479 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1898859347, now seen corresponding path program 1 times [2022-11-03 03:54:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430826530] [2022-11-03 03:54:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:54:03,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430826530] [2022-11-03 03:54:03,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430826530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:03,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:03,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872186122] [2022-11-03 03:54:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:03,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:03,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:03,515 INFO L87 Difference]: Start difference. First operand 525 states and 710 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:03,700 INFO L93 Difference]: Finished difference Result 679 states and 919 transitions. [2022-11-03 03:54:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:03,701 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-03 03:54:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:03,704 INFO L225 Difference]: With dead ends: 679 [2022-11-03 03:54:03,704 INFO L226 Difference]: Without dead ends: 505 [2022-11-03 03:54:03,705 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 03:54:03,706 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:03,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 733 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-03 03:54:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-11-03 03:54:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 386 states have (on average 1.2849740932642486) internal successors, (496), 391 states have internal predecessors, (496), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (100), 82 states have call predecessors, (100), 80 states have call successors, (100) [2022-11-03 03:54:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 682 transitions. [2022-11-03 03:54:03,769 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 682 transitions. Word has length 34 [2022-11-03 03:54:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:03,769 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 682 transitions. [2022-11-03 03:54:03,770 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 682 transitions. [2022-11-03 03:54:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 03:54:03,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:03,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:03,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 03:54:03,772 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash 533000946, now seen corresponding path program 1 times [2022-11-03 03:54:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:03,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121050033] [2022-11-03 03:54:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:03,854 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 03:54:03,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:03,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121050033] [2022-11-03 03:54:03,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121050033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:03,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:03,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:54:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539095157] [2022-11-03 03:54:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:03,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:03,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:03,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:03,856 INFO L87 Difference]: Start difference. First operand 505 states and 682 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:04,171 INFO L93 Difference]: Finished difference Result 521 states and 697 transitions. [2022-11-03 03:54:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:04,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-03 03:54:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:04,174 INFO L225 Difference]: With dead ends: 521 [2022-11-03 03:54:04,174 INFO L226 Difference]: Without dead ends: 499 [2022-11-03 03:54:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:04,176 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 38 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:04,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1846 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-03 03:54:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2022-11-03 03:54:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 383 states have (on average 1.279373368146214) internal successors, (490), 388 states have internal predecessors, (490), 83 states have call successors, (83), 31 states have call predecessors, (83), 32 states have return successors, (97), 79 states have call predecessors, (97), 77 states have call successors, (97) [2022-11-03 03:54:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 670 transitions. [2022-11-03 03:54:04,238 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 670 transitions. Word has length 33 [2022-11-03 03:54:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:04,239 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 670 transitions. [2022-11-03 03:54:04,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 670 transitions. [2022-11-03 03:54:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:54:04,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:04,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:04,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 03:54:04,242 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1088740816, now seen corresponding path program 1 times [2022-11-03 03:54:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:04,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963671265] [2022-11-03 03:54:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:04,331 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 03:54:04,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963671265] [2022-11-03 03:54:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963671265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:04,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:04,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:54:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124752059] [2022-11-03 03:54:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:04,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:04,337 INFO L87 Difference]: Start difference. First operand 499 states and 670 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:04,628 INFO L93 Difference]: Finished difference Result 519 states and 690 transitions. [2022-11-03 03:54:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-11-03 03:54:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:04,631 INFO L225 Difference]: With dead ends: 519 [2022-11-03 03:54:04,631 INFO L226 Difference]: Without dead ends: 495 [2022-11-03 03:54:04,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:04,632 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 40 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:04,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1820 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-11-03 03:54:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-11-03 03:54:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 381 states have (on average 1.2703412073490814) internal successors, (484), 386 states have internal predecessors, (484), 81 states have call successors, (81), 31 states have call predecessors, (81), 32 states have return successors, (95), 77 states have call predecessors, (95), 75 states have call successors, (95) [2022-11-03 03:54:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 660 transitions. [2022-11-03 03:54:04,703 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 660 transitions. Word has length 34 [2022-11-03 03:54:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:04,704 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 660 transitions. [2022-11-03 03:54:04,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:54:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 660 transitions. [2022-11-03 03:54:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:54:04,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:04,706 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 03:54:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 03:54:04,707 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1427718109, now seen corresponding path program 1 times [2022-11-03 03:54:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753436616] [2022-11-03 03:54:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:04,905 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 03:54:04,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:04,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753436616] [2022-11-03 03:54:04,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753436616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:04,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:04,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687219502] [2022-11-03 03:54:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:04,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:04,908 INFO L87 Difference]: Start difference. First operand 495 states and 660 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:05,380 INFO L93 Difference]: Finished difference Result 508 states and 672 transitions. [2022-11-03 03:54:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 03:54:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:05,384 INFO L225 Difference]: With dead ends: 508 [2022-11-03 03:54:05,384 INFO L226 Difference]: Without dead ends: 493 [2022-11-03 03:54:05,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:05,385 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 10 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:05,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2832 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-11-03 03:54:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2022-11-03 03:54:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 380 states have (on average 1.268421052631579) internal successors, (482), 385 states have internal predecessors, (482), 80 states have call successors, (80), 31 states have call predecessors, (80), 32 states have return successors, (94), 76 states have call predecessors, (94), 74 states have call successors, (94) [2022-11-03 03:54:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 656 transitions. [2022-11-03 03:54:05,449 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 656 transitions. Word has length 36 [2022-11-03 03:54:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:05,449 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 656 transitions. [2022-11-03 03:54:05,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 656 transitions. [2022-11-03 03:54:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:54:05,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:05,451 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 03:54:05,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 03:54:05,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash 690743687, now seen corresponding path program 1 times [2022-11-03 03:54:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:05,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311252429] [2022-11-03 03:54:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:05,623 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 03:54:05,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:05,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311252429] [2022-11-03 03:54:05,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311252429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:05,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:05,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607583290] [2022-11-03 03:54:05,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:05,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:05,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:05,625 INFO L87 Difference]: Start difference. First operand 493 states and 656 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:06,083 INFO L93 Difference]: Finished difference Result 506 states and 668 transitions. [2022-11-03 03:54:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-03 03:54:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:06,086 INFO L225 Difference]: With dead ends: 506 [2022-11-03 03:54:06,086 INFO L226 Difference]: Without dead ends: 491 [2022-11-03 03:54:06,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:06,087 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 10 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:06,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2815 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-03 03:54:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-11-03 03:54:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 379 states have (on average 1.266490765171504) internal successors, (480), 384 states have internal predecessors, (480), 79 states have call successors, (79), 31 states have call predecessors, (79), 32 states have return successors, (93), 75 states have call predecessors, (93), 73 states have call successors, (93) [2022-11-03 03:54:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 652 transitions. [2022-11-03 03:54:06,153 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 652 transitions. Word has length 35 [2022-11-03 03:54:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:06,153 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 652 transitions. [2022-11-03 03:54:06,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 652 transitions. [2022-11-03 03:54:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:54:06,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:06,156 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 03:54:06,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 03:54:06,156 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1082848335, now seen corresponding path program 1 times [2022-11-03 03:54:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:06,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554181048] [2022-11-03 03:54:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:06,292 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 03:54:06,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:06,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554181048] [2022-11-03 03:54:06,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554181048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:06,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:06,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136918955] [2022-11-03 03:54:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:06,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:06,295 INFO L87 Difference]: Start difference. First operand 491 states and 652 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:06,777 INFO L93 Difference]: Finished difference Result 507 states and 667 transitions. [2022-11-03 03:54:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 03:54:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:06,781 INFO L225 Difference]: With dead ends: 507 [2022-11-03 03:54:06,781 INFO L226 Difference]: Without dead ends: 489 [2022-11-03 03:54:06,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:06,784 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 36 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:06,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2739 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-03 03:54:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2022-11-03 03:54:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 378 states have (on average 1.2645502645502646) internal successors, (478), 383 states have internal predecessors, (478), 78 states have call successors, (78), 31 states have call predecessors, (78), 32 states have return successors, (92), 74 states have call predecessors, (92), 72 states have call successors, (92) [2022-11-03 03:54:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 648 transitions. [2022-11-03 03:54:06,845 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 648 transitions. Word has length 36 [2022-11-03 03:54:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:06,846 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 648 transitions. [2022-11-03 03:54:06,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 648 transitions. [2022-11-03 03:54:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:54:06,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:06,848 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 03:54:06,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 03:54:06,849 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 313262396, now seen corresponding path program 1 times [2022-11-03 03:54:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:06,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745440210] [2022-11-03 03:54:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:07,030 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 03:54:07,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745440210] [2022-11-03 03:54:07,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745440210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:07,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:07,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218811683] [2022-11-03 03:54:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:07,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:07,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:07,032 INFO L87 Difference]: Start difference. First operand 489 states and 648 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:07,464 INFO L93 Difference]: Finished difference Result 501 states and 659 transitions. [2022-11-03 03:54:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 03:54:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:07,467 INFO L225 Difference]: With dead ends: 501 [2022-11-03 03:54:07,467 INFO L226 Difference]: Without dead ends: 486 [2022-11-03 03:54:07,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:07,468 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 10 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:07,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2735 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-03 03:54:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-11-03 03:54:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 381 states have internal predecessors, (475), 77 states have call successors, (77), 31 states have call predecessors, (77), 32 states have return successors, (91), 73 states have call predecessors, (91), 71 states have call successors, (91) [2022-11-03 03:54:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 643 transitions. [2022-11-03 03:54:07,524 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 643 transitions. Word has length 36 [2022-11-03 03:54:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:07,525 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 643 transitions. [2022-11-03 03:54:07,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 643 transitions. [2022-11-03 03:54:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:54:07,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:07,527 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 03:54:07,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 03:54:07,527 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 832283712, now seen corresponding path program 1 times [2022-11-03 03:54:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295159127] [2022-11-03 03:54:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:07,595 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 03:54:07,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:07,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295159127] [2022-11-03 03:54:07,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295159127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:07,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:07,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:54:07,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218336157] [2022-11-03 03:54:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:07,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:54:07,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:07,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:54:07,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:54:07,598 INFO L87 Difference]: Start difference. First operand 486 states and 643 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:07,849 INFO L93 Difference]: Finished difference Result 536 states and 709 transitions. [2022-11-03 03:54:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:54:07,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 03:54:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:07,853 INFO L225 Difference]: With dead ends: 536 [2022-11-03 03:54:07,853 INFO L226 Difference]: Without dead ends: 514 [2022-11-03 03:54:07,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:54:07,854 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 15 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:07,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1401 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-03 03:54:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2022-11-03 03:54:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 382 states have (on average 1.2591623036649215) internal successors, (481), 390 states have internal predecessors, (481), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (110), 74 states have call predecessors, (110), 71 states have call successors, (110) [2022-11-03 03:54:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2022-11-03 03:54:07,918 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 36 [2022-11-03 03:54:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:07,919 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2022-11-03 03:54:07,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2022-11-03 03:54:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:54:07,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:07,921 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 03:54:07,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 03:54:07,922 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1717177046, now seen corresponding path program 1 times [2022-11-03 03:54:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:07,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77112143] [2022-11-03 03:54:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:07,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:07,995 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 03:54:07,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:07,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77112143] [2022-11-03 03:54:07,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77112143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:07,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:07,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:54:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94346700] [2022-11-03 03:54:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:07,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:07,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:07,998 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:08,266 INFO L93 Difference]: Finished difference Result 512 states and 683 transitions. [2022-11-03 03:54:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-11-03 03:54:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:08,269 INFO L225 Difference]: With dead ends: 512 [2022-11-03 03:54:08,269 INFO L226 Difference]: Without dead ends: 492 [2022-11-03 03:54:08,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:08,271 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 36 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:08,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1720 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-03 03:54:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-11-03 03:54:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 379 states have (on average 1.2585751978891822) internal successors, (477), 388 states have internal predecessors, (477), 76 states have call successors, (76), 31 states have call predecessors, (76), 36 states have return successors, (108), 72 states have call predecessors, (108), 70 states have call successors, (108) [2022-11-03 03:54:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2022-11-03 03:54:08,362 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 36 [2022-11-03 03:54:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:08,363 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2022-11-03 03:54:08,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2022-11-03 03:54:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:54:08,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:08,368 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 03:54:08,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 03:54:08,368 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1270734155, now seen corresponding path program 1 times [2022-11-03 03:54:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:08,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497474343] [2022-11-03 03:54:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:08,443 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 03:54:08,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:08,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497474343] [2022-11-03 03:54:08,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497474343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:08,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:08,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:54:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561293940] [2022-11-03 03:54:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:08,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:54:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:54:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:54:08,446 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:08,727 INFO L93 Difference]: Finished difference Result 566 states and 741 transitions. [2022-11-03 03:54:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:54:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-03 03:54:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:08,731 INFO L225 Difference]: With dead ends: 566 [2022-11-03 03:54:08,731 INFO L226 Difference]: Without dead ends: 544 [2022-11-03 03:54:08,732 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 03:54:08,732 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 115 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:08,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1352 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-03 03:54:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 496. [2022-11-03 03:54:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 382 states have (on average 1.256544502617801) internal successors, (480), 391 states have internal predecessors, (480), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (110), 73 states have call predecessors, (110), 71 states have call successors, (110) [2022-11-03 03:54:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 667 transitions. [2022-11-03 03:54:08,791 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 667 transitions. Word has length 37 [2022-11-03 03:54:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:08,792 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 667 transitions. [2022-11-03 03:54:08,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 667 transitions. [2022-11-03 03:54:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 03:54:08,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:08,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:08,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 03:54:08,794 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash -611230327, now seen corresponding path program 1 times [2022-11-03 03:54:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:08,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890698110] [2022-11-03 03:54:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:09,027 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 03:54:09,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:09,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890698110] [2022-11-03 03:54:09,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890698110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:09,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:09,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:54:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024209294] [2022-11-03 03:54:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:54:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:09,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:54:09,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:54:09,030 INFO L87 Difference]: Start difference. First operand 496 states and 667 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:09,556 INFO L93 Difference]: Finished difference Result 509 states and 679 transitions. [2022-11-03 03:54:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:54:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-03 03:54:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:09,559 INFO L225 Difference]: With dead ends: 509 [2022-11-03 03:54:09,560 INFO L226 Difference]: Without dead ends: 487 [2022-11-03 03:54:09,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:54:09,561 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 20 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:09,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3028 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-03 03:54:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2022-11-03 03:54:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 375 states have (on average 1.256) internal successors, (471), 384 states have internal predecessors, (471), 75 states have call successors, (75), 31 states have call predecessors, (75), 36 states have return successors, (108), 71 states have call predecessors, (108), 69 states have call successors, (108) [2022-11-03 03:54:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 654 transitions. [2022-11-03 03:54:09,624 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 654 transitions. Word has length 44 [2022-11-03 03:54:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:09,625 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 654 transitions. [2022-11-03 03:54:09,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 654 transitions. [2022-11-03 03:54:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:54:09,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:09,627 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 03:54:09,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 03:54:09,627 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1001445951, now seen corresponding path program 1 times [2022-11-03 03:54:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:09,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816189305] [2022-11-03 03:54:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:54:09,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:09,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816189305] [2022-11-03 03:54:09,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816189305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:09,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:09,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:54:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227592796] [2022-11-03 03:54:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:09,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:54:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:54:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:54:09,861 INFO L87 Difference]: Start difference. First operand 487 states and 654 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:10,363 INFO L93 Difference]: Finished difference Result 500 states and 666 transitions. [2022-11-03 03:54:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:54:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-03 03:54:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:10,366 INFO L225 Difference]: With dead ends: 500 [2022-11-03 03:54:10,366 INFO L226 Difference]: Without dead ends: 484 [2022-11-03 03:54:10,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:54:10,368 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 20 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:10,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2932 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-03 03:54:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2022-11-03 03:54:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 373 states have (on average 1.2546916890080428) internal successors, (468), 382 states have internal predecessors, (468), 74 states have call successors, (74), 31 states have call predecessors, (74), 36 states have return successors, (107), 70 states have call predecessors, (107), 68 states have call successors, (107) [2022-11-03 03:54:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 649 transitions. [2022-11-03 03:54:10,430 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 649 transitions. Word has length 37 [2022-11-03 03:54:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:10,430 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 649 transitions. [2022-11-03 03:54:10,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 649 transitions. [2022-11-03 03:54:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:54:10,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:10,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 03:54:10,433 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 18666936, now seen corresponding path program 1 times [2022-11-03 03:54:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427879525] [2022-11-03 03:54:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:10,502 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 03:54:10,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:10,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427879525] [2022-11-03 03:54:10,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427879525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:10,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:10,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592072755] [2022-11-03 03:54:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:10,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:10,505 INFO L87 Difference]: Start difference. First operand 484 states and 649 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:54:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:10,677 INFO L93 Difference]: Finished difference Result 671 states and 895 transitions. [2022-11-03 03:54:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:10,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-03 03:54:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:10,680 INFO L225 Difference]: With dead ends: 671 [2022-11-03 03:54:10,681 INFO L226 Difference]: Without dead ends: 552 [2022-11-03 03:54:10,682 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 03:54:10,682 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 77 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:10,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 679 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-11-03 03:54:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 533. [2022-11-03 03:54:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 411 states have (on average 1.2554744525547445) internal successors, (516), 421 states have internal predecessors, (516), 77 states have call successors, (77), 35 states have call predecessors, (77), 44 states have return successors, (122), 76 states have call predecessors, (122), 72 states have call successors, (122) [2022-11-03 03:54:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 715 transitions. [2022-11-03 03:54:10,754 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 715 transitions. Word has length 40 [2022-11-03 03:54:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:10,754 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 715 transitions. [2022-11-03 03:54:10,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:54:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 715 transitions. [2022-11-03 03:54:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 03:54:10,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:10,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 03:54:10,757 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1911289332, now seen corresponding path program 1 times [2022-11-03 03:54:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:10,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712502701] [2022-11-03 03:54:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:10,867 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 03:54:10,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712502701] [2022-11-03 03:54:10,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712502701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:10,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:10,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325690490] [2022-11-03 03:54:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:10,869 INFO L87 Difference]: Start difference. First operand 533 states and 715 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:11,288 INFO L93 Difference]: Finished difference Result 560 states and 745 transitions. [2022-11-03 03:54:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-03 03:54:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:11,292 INFO L225 Difference]: With dead ends: 560 [2022-11-03 03:54:11,292 INFO L226 Difference]: Without dead ends: 542 [2022-11-03 03:54:11,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:11,293 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 38 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:11,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2263 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-03 03:54:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 533. [2022-11-03 03:54:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 411 states have (on average 1.2554744525547445) internal successors, (516), 421 states have internal predecessors, (516), 77 states have call successors, (77), 35 states have call predecessors, (77), 44 states have return successors, (122), 76 states have call predecessors, (122), 72 states have call successors, (122) [2022-11-03 03:54:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 715 transitions. [2022-11-03 03:54:11,417 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 715 transitions. Word has length 38 [2022-11-03 03:54:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:11,417 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 715 transitions. [2022-11-03 03:54:11,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 715 transitions. [2022-11-03 03:54:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 03:54:11,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:11,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:11,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 03:54:11,420 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash 205686855, now seen corresponding path program 1 times [2022-11-03 03:54:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:11,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163566287] [2022-11-03 03:54:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:11,651 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 03:54:11,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:11,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163566287] [2022-11-03 03:54:11,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163566287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:11,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:11,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:54:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249455189] [2022-11-03 03:54:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:11,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:54:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:54:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:54:11,654 INFO L87 Difference]: Start difference. First operand 533 states and 715 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:12,166 INFO L93 Difference]: Finished difference Result 546 states and 727 transitions. [2022-11-03 03:54:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:54:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-11-03 03:54:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:12,169 INFO L225 Difference]: With dead ends: 546 [2022-11-03 03:54:12,170 INFO L226 Difference]: Without dead ends: 530 [2022-11-03 03:54:12,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:54:12,171 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 20 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:12,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2858 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-03 03:54:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-03 03:54:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 409 states have (on average 1.254278728606357) internal successors, (513), 419 states have internal predecessors, (513), 76 states have call successors, (76), 35 states have call predecessors, (76), 44 states have return successors, (121), 75 states have call predecessors, (121), 71 states have call successors, (121) [2022-11-03 03:54:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 710 transitions. [2022-11-03 03:54:12,234 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 710 transitions. Word has length 38 [2022-11-03 03:54:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:12,234 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 710 transitions. [2022-11-03 03:54:12,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 710 transitions. [2022-11-03 03:54:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 03:54:12,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:12,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:12,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 03:54:12,237 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1841940867, now seen corresponding path program 1 times [2022-11-03 03:54:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180885163] [2022-11-03 03:54:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:12,264 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 03:54:12,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180885163] [2022-11-03 03:54:12,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180885163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:12,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:12,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755732047] [2022-11-03 03:54:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:12,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:12,266 INFO L87 Difference]: Start difference. First operand 530 states and 710 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:12,397 INFO L93 Difference]: Finished difference Result 685 states and 906 transitions. [2022-11-03 03:54:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-03 03:54:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:12,400 INFO L225 Difference]: With dead ends: 685 [2022-11-03 03:54:12,400 INFO L226 Difference]: Without dead ends: 450 [2022-11-03 03:54:12,401 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 03:54:12,402 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:12,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 609 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-03 03:54:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 433. [2022-11-03 03:54:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 336 states have (on average 1.2291666666666667) internal successors, (413), 342 states have internal predecessors, (413), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (71), 61 states have call predecessors, (71), 59 states have call successors, (71) [2022-11-03 03:54:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 548 transitions. [2022-11-03 03:54:12,475 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 548 transitions. Word has length 38 [2022-11-03 03:54:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:12,475 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 548 transitions. [2022-11-03 03:54:12,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 548 transitions. [2022-11-03 03:54:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:54:12,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 03:54:12,478 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1916437213, now seen corresponding path program 1 times [2022-11-03 03:54:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:12,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906907704] [2022-11-03 03:54:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:12,722 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 03:54:12,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:12,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906907704] [2022-11-03 03:54:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906907704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:12,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:12,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:54:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405369851] [2022-11-03 03:54:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:12,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:54:12,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:54:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:12,726 INFO L87 Difference]: Start difference. First operand 433 states and 548 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:13,249 INFO L93 Difference]: Finished difference Result 465 states and 580 transitions. [2022-11-03 03:54:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:54:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-03 03:54:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:13,252 INFO L225 Difference]: With dead ends: 465 [2022-11-03 03:54:13,252 INFO L226 Difference]: Without dead ends: 444 [2022-11-03 03:54:13,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:54:13,253 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 39 mSDsluCounter, 3066 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:13,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2949 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-03 03:54:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 430. [2022-11-03 03:54:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 334 states have (on average 1.2275449101796407) internal successors, (410), 340 states have internal predecessors, (410), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (70), 60 states have call predecessors, (70), 58 states have call successors, (70) [2022-11-03 03:54:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 543 transitions. [2022-11-03 03:54:13,306 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 543 transitions. Word has length 41 [2022-11-03 03:54:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 543 transitions. [2022-11-03 03:54:13,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 543 transitions. [2022-11-03 03:54:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:54:13,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:13,308 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 03:54:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 03:54:13,309 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2034019404, now seen corresponding path program 1 times [2022-11-03 03:54:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:13,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176848842] [2022-11-03 03:54:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:13,491 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 03:54:13,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:13,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176848842] [2022-11-03 03:54:13,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176848842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:13,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:13,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:13,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433363098] [2022-11-03 03:54:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:13,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:13,493 INFO L87 Difference]: Start difference. First operand 430 states and 543 transitions. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:13,960 INFO L93 Difference]: Finished difference Result 460 states and 572 transitions. [2022-11-03 03:54:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-03 03:54:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:13,963 INFO L225 Difference]: With dead ends: 460 [2022-11-03 03:54:13,964 INFO L226 Difference]: Without dead ends: 442 [2022-11-03 03:54:13,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:13,965 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 38 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:13,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2350 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-03 03:54:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 428. [2022-11-03 03:54:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 333 states have (on average 1.2252252252252251) internal successors, (408), 339 states have internal predecessors, (408), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (69), 59 states have call predecessors, (69), 57 states have call successors, (69) [2022-11-03 03:54:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 539 transitions. [2022-11-03 03:54:14,027 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 539 transitions. Word has length 41 [2022-11-03 03:54:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:14,027 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 539 transitions. [2022-11-03 03:54:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 539 transitions. [2022-11-03 03:54:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:14,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:14,029 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 03:54:14,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 03:54:14,030 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash 570409239, now seen corresponding path program 1 times [2022-11-03 03:54:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:14,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999371338] [2022-11-03 03:54:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:14,237 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 03:54:14,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999371338] [2022-11-03 03:54:14,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999371338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:14,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:54:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517062204] [2022-11-03 03:54:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:14,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:54:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:54:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:14,239 INFO L87 Difference]: Start difference. First operand 428 states and 539 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:14,745 INFO L93 Difference]: Finished difference Result 460 states and 571 transitions. [2022-11-03 03:54:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:54:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 03:54:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:14,748 INFO L225 Difference]: With dead ends: 460 [2022-11-03 03:54:14,748 INFO L226 Difference]: Without dead ends: 439 [2022-11-03 03:54:14,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:54:14,749 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 38 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:14,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2910 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-03 03:54:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 425. [2022-11-03 03:54:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 331 states have (on average 1.2235649546827794) internal successors, (405), 337 states have internal predecessors, (405), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (68), 58 states have call predecessors, (68), 56 states have call successors, (68) [2022-11-03 03:54:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 534 transitions. [2022-11-03 03:54:14,807 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 534 transitions. Word has length 42 [2022-11-03 03:54:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:14,807 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 534 transitions. [2022-11-03 03:54:14,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 534 transitions. [2022-11-03 03:54:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:54:14,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:14,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:14,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 03:54:14,810 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 934382011, now seen corresponding path program 1 times [2022-11-03 03:54:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:14,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576091812] [2022-11-03 03:54:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:54:15,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:15,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576091812] [2022-11-03 03:54:15,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576091812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:15,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:15,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056160382] [2022-11-03 03:54:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:15,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:15,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:15,027 INFO L87 Difference]: Start difference. First operand 425 states and 534 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:15,431 INFO L93 Difference]: Finished difference Result 441 states and 549 transitions. [2022-11-03 03:54:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:15,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2022-11-03 03:54:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:15,434 INFO L225 Difference]: With dead ends: 441 [2022-11-03 03:54:15,434 INFO L226 Difference]: Without dead ends: 423 [2022-11-03 03:54:15,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:15,435 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 36 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:15,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2264 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-03 03:54:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-11-03 03:54:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 330 states have (on average 1.2212121212121212) internal successors, (403), 336 states have internal predecessors, (403), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (67), 57 states have call predecessors, (67), 55 states have call successors, (67) [2022-11-03 03:54:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 530 transitions. [2022-11-03 03:54:15,488 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 530 transitions. Word has length 40 [2022-11-03 03:54:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:15,488 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 530 transitions. [2022-11-03 03:54:15,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 530 transitions. [2022-11-03 03:54:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 03:54:15,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:15,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:15,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-03 03:54:15,491 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2106398727, now seen corresponding path program 1 times [2022-11-03 03:54:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:15,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587713045] [2022-11-03 03:54:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:15,703 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 03:54:15,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587713045] [2022-11-03 03:54:15,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587713045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:15,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:15,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097290242] [2022-11-03 03:54:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:15,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:15,707 INFO L87 Difference]: Start difference. First operand 423 states and 530 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:16,069 INFO L93 Difference]: Finished difference Result 442 states and 549 transitions. [2022-11-03 03:54:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-03 03:54:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:16,072 INFO L225 Difference]: With dead ends: 442 [2022-11-03 03:54:16,072 INFO L226 Difference]: Without dead ends: 420 [2022-11-03 03:54:16,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:16,073 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 36 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:16,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2010 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-03 03:54:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-11-03 03:54:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 328 states have (on average 1.2195121951219512) internal successors, (400), 334 states have internal predecessors, (400), 59 states have call successors, (59), 29 states have call predecessors, (59), 32 states have return successors, (66), 56 states have call predecessors, (66), 54 states have call successors, (66) [2022-11-03 03:54:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2022-11-03 03:54:16,127 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 39 [2022-11-03 03:54:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:16,127 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2022-11-03 03:54:16,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2022-11-03 03:54:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:16,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:16,129 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 03:54:16,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 03:54:16,130 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 173425950, now seen corresponding path program 1 times [2022-11-03 03:54:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:16,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563249616] [2022-11-03 03:54:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:16,173 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 03:54:16,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:16,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563249616] [2022-11-03 03:54:16,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563249616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:16,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:16,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136117578] [2022-11-03 03:54:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:16,178 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:54:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:16,314 INFO L93 Difference]: Finished difference Result 467 states and 581 transitions. [2022-11-03 03:54:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:16,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-11-03 03:54:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:16,317 INFO L225 Difference]: With dead ends: 467 [2022-11-03 03:54:16,317 INFO L226 Difference]: Without dead ends: 420 [2022-11-03 03:54:16,317 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 03:54:16,325 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:16,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 566 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-03 03:54:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-11-03 03:54:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 328 states have (on average 1.2164634146341464) internal successors, (399), 334 states have internal predecessors, (399), 59 states have call successors, (59), 29 states have call predecessors, (59), 32 states have return successors, (66), 56 states have call predecessors, (66), 54 states have call successors, (66) [2022-11-03 03:54:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 524 transitions. [2022-11-03 03:54:16,381 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 524 transitions. Word has length 42 [2022-11-03 03:54:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:16,381 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 524 transitions. [2022-11-03 03:54:16,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:54:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 524 transitions. [2022-11-03 03:54:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:16,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:16,383 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 03:54:16,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-03 03:54:16,384 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1228872583, now seen corresponding path program 1 times [2022-11-03 03:54:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:16,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646879385] [2022-11-03 03:54:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:16,593 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 03:54:16,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:16,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646879385] [2022-11-03 03:54:16,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646879385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:16,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:16,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:54:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684015619] [2022-11-03 03:54:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:16,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:54:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:54:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:16,597 INFO L87 Difference]: Start difference. First operand 420 states and 524 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:17,056 INFO L93 Difference]: Finished difference Result 438 states and 542 transitions. [2022-11-03 03:54:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:54:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 03:54:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:17,059 INFO L225 Difference]: With dead ends: 438 [2022-11-03 03:54:17,060 INFO L226 Difference]: Without dead ends: 415 [2022-11-03 03:54:17,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:54:17,061 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 36 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:17,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2824 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-03 03:54:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-11-03 03:54:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 324 states have (on average 1.2160493827160495) internal successors, (394), 330 states have internal predecessors, (394), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (65), 55 states have call predecessors, (65), 53 states have call successors, (65) [2022-11-03 03:54:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 517 transitions. [2022-11-03 03:54:17,122 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 517 transitions. Word has length 42 [2022-11-03 03:54:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:17,122 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 517 transitions. [2022-11-03 03:54:17,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 517 transitions. [2022-11-03 03:54:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 03:54:17,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:17,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-03 03:54:17,125 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -527108216, now seen corresponding path program 1 times [2022-11-03 03:54:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:17,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213456280] [2022-11-03 03:54:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:17,316 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 03:54:17,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213456280] [2022-11-03 03:54:17,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213456280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:17,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:17,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353607583] [2022-11-03 03:54:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:17,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:17,319 INFO L87 Difference]: Start difference. First operand 415 states and 517 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:17,739 INFO L93 Difference]: Finished difference Result 452 states and 556 transitions. [2022-11-03 03:54:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-03 03:54:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:17,741 INFO L225 Difference]: With dead ends: 452 [2022-11-03 03:54:17,742 INFO L226 Difference]: Without dead ends: 434 [2022-11-03 03:54:17,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:17,742 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 55 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:17,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2256 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-03 03:54:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 413. [2022-11-03 03:54:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 323 states have (on average 1.2136222910216719) internal successors, (392), 329 states have internal predecessors, (392), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (64), 54 states have call predecessors, (64), 52 states have call successors, (64) [2022-11-03 03:54:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 513 transitions. [2022-11-03 03:54:17,796 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 513 transitions. Word has length 47 [2022-11-03 03:54:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:17,797 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 513 transitions. [2022-11-03 03:54:17,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 513 transitions. [2022-11-03 03:54:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:17,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:17,799 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 03:54:17,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-03 03:54:17,799 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -132093720, now seen corresponding path program 1 times [2022-11-03 03:54:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:17,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587064205] [2022-11-03 03:54:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:18,020 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 03:54:18,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:18,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587064205] [2022-11-03 03:54:18,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587064205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:18,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:18,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:54:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280460058] [2022-11-03 03:54:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:18,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:54:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:54:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:18,023 INFO L87 Difference]: Start difference. First operand 413 states and 513 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:18,473 INFO L93 Difference]: Finished difference Result 431 states and 531 transitions. [2022-11-03 03:54:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:54:18,473 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-03 03:54:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:18,475 INFO L225 Difference]: With dead ends: 431 [2022-11-03 03:54:18,475 INFO L226 Difference]: Without dead ends: 407 [2022-11-03 03:54:18,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:54:18,476 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 36 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:18,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2736 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-03 03:54:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-11-03 03:54:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 318 states have (on average 1.2138364779874213) internal successors, (386), 324 states have internal predecessors, (386), 56 states have call successors, (56), 29 states have call predecessors, (56), 32 states have return successors, (63), 53 states have call predecessors, (63), 51 states have call successors, (63) [2022-11-03 03:54:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 505 transitions. [2022-11-03 03:54:18,531 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 505 transitions. Word has length 42 [2022-11-03 03:54:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:18,531 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 505 transitions. [2022-11-03 03:54:18,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 505 transitions. [2022-11-03 03:54:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:54:18,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:18,533 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 03:54:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-03 03:54:18,534 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash 472498752, now seen corresponding path program 1 times [2022-11-03 03:54:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:18,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653587438] [2022-11-03 03:54:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:18,659 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 03:54:18,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653587438] [2022-11-03 03:54:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653587438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112325103] [2022-11-03 03:54:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:18,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:18,662 INFO L87 Difference]: Start difference. First operand 407 states and 505 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:18,989 INFO L93 Difference]: Finished difference Result 426 states and 524 transitions. [2022-11-03 03:54:18,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:18,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-03 03:54:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:18,991 INFO L225 Difference]: With dead ends: 426 [2022-11-03 03:54:18,992 INFO L226 Difference]: Without dead ends: 404 [2022-11-03 03:54:18,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:18,994 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 36 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:18,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1892 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-03 03:54:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2022-11-03 03:54:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 316 states have (on average 1.2120253164556962) internal successors, (383), 322 states have internal predecessors, (383), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (62), 52 states have call predecessors, (62), 50 states have call successors, (62) [2022-11-03 03:54:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 500 transitions. [2022-11-03 03:54:19,045 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 500 transitions. Word has length 41 [2022-11-03 03:54:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:19,046 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 500 transitions. [2022-11-03 03:54:19,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 500 transitions. [2022-11-03 03:54:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:54:19,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:19,048 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 03:54:19,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 03:54:19,048 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -349639091, now seen corresponding path program 1 times [2022-11-03 03:54:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:19,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837823218] [2022-11-03 03:54:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:54:19,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:19,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837823218] [2022-11-03 03:54:19,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837823218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:19,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:19,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:54:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222162523] [2022-11-03 03:54:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:19,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:19,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:19,134 INFO L87 Difference]: Start difference. First operand 404 states and 500 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:19,376 INFO L93 Difference]: Finished difference Result 423 states and 519 transitions. [2022-11-03 03:54:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-03 03:54:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:19,378 INFO L225 Difference]: With dead ends: 423 [2022-11-03 03:54:19,378 INFO L226 Difference]: Without dead ends: 387 [2022-11-03 03:54:19,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:19,379 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 44 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:19,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1312 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-03 03:54:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2022-11-03 03:54:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 304 states have (on average 1.207236842105263) internal successors, (367), 310 states have internal predecessors, (367), 50 states have call successors, (50), 29 states have call predecessors, (50), 32 states have return successors, (57), 47 states have call predecessors, (57), 45 states have call successors, (57) [2022-11-03 03:54:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 474 transitions. [2022-11-03 03:54:19,432 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 474 transitions. Word has length 41 [2022-11-03 03:54:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:19,432 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 474 transitions. [2022-11-03 03:54:19,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 474 transitions. [2022-11-03 03:54:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:54:19,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:19,434 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 03:54:19,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-03 03:54:19,434 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1201965096, now seen corresponding path program 1 times [2022-11-03 03:54:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750216001] [2022-11-03 03:54:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:19,468 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 03:54:19,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750216001] [2022-11-03 03:54:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750216001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:19,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043004594] [2022-11-03 03:54:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:19,470 INFO L87 Difference]: Start difference. First operand 387 states and 474 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:19,644 INFO L93 Difference]: Finished difference Result 477 states and 588 transitions. [2022-11-03 03:54:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-03 03:54:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:19,647 INFO L225 Difference]: With dead ends: 477 [2022-11-03 03:54:19,647 INFO L226 Difference]: Without dead ends: 465 [2022-11-03 03:54:19,648 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 03:54:19,648 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 64 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:19,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 490 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-11-03 03:54:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 413. [2022-11-03 03:54:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 328 states have (on average 1.204268292682927) internal successors, (395), 334 states have internal predecessors, (395), 50 states have call successors, (50), 29 states have call predecessors, (50), 34 states have return successors, (59), 49 states have call predecessors, (59), 45 states have call successors, (59) [2022-11-03 03:54:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 504 transitions. [2022-11-03 03:54:19,708 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 504 transitions. Word has length 41 [2022-11-03 03:54:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:19,709 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 504 transitions. [2022-11-03 03:54:19,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 504 transitions. [2022-11-03 03:54:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:19,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:19,711 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 03:54:19,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-03 03:54:19,713 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 715464599, now seen corresponding path program 1 times [2022-11-03 03:54:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:19,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773858795] [2022-11-03 03:54:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:19,838 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 03:54:19,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:19,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773858795] [2022-11-03 03:54:19,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773858795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:19,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:19,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486302172] [2022-11-03 03:54:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:19,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:19,841 INFO L87 Difference]: Start difference. First operand 413 states and 504 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:20,114 INFO L93 Difference]: Finished difference Result 432 states and 523 transitions. [2022-11-03 03:54:20,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:20,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-11-03 03:54:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:20,117 INFO L225 Difference]: With dead ends: 432 [2022-11-03 03:54:20,117 INFO L226 Difference]: Without dead ends: 411 [2022-11-03 03:54:20,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:20,118 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 36 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:20,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1717 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-03 03:54:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2022-11-03 03:54:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 327 states have (on average 1.201834862385321) internal successors, (393), 333 states have internal predecessors, (393), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (58), 48 states have call predecessors, (58), 44 states have call successors, (58) [2022-11-03 03:54:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 500 transitions. [2022-11-03 03:54:20,176 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 500 transitions. Word has length 42 [2022-11-03 03:54:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:20,176 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 500 transitions. [2022-11-03 03:54:20,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 500 transitions. [2022-11-03 03:54:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:54:20,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:20,179 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 03:54:20,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-03 03:54:20,179 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1838564876, now seen corresponding path program 1 times [2022-11-03 03:54:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:20,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320626992] [2022-11-03 03:54:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:20,242 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 03:54:20,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320626992] [2022-11-03 03:54:20,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320626992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:20,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:20,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:54:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917947977] [2022-11-03 03:54:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:20,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:54:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:54:20,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:54:20,245 INFO L87 Difference]: Start difference. First operand 411 states and 500 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:20,697 INFO L93 Difference]: Finished difference Result 469 states and 573 transitions. [2022-11-03 03:54:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:54:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-11-03 03:54:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:20,700 INFO L225 Difference]: With dead ends: 469 [2022-11-03 03:54:20,700 INFO L226 Difference]: Without dead ends: 460 [2022-11-03 03:54:20,701 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 03:54:20,701 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 403 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:20,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 557 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-03 03:54:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 411. [2022-11-03 03:54:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 333 states have internal predecessors, (391), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (58), 48 states have call predecessors, (58), 44 states have call successors, (58) [2022-11-03 03:54:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 498 transitions. [2022-11-03 03:54:20,766 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 498 transitions. Word has length 42 [2022-11-03 03:54:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:20,766 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 498 transitions. [2022-11-03 03:54:20,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 498 transitions. [2022-11-03 03:54:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 03:54:20,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:20,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:20,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-03 03:54:20,768 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:20,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 521245437, now seen corresponding path program 1 times [2022-11-03 03:54:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590992204] [2022-11-03 03:54:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:20,855 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 03:54:20,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:20,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590992204] [2022-11-03 03:54:20,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590992204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:20,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:20,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:54:20,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360384865] [2022-11-03 03:54:20,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:20,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:54:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:54:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:54:20,858 INFO L87 Difference]: Start difference. First operand 411 states and 498 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:21,297 INFO L93 Difference]: Finished difference Result 460 states and 561 transitions. [2022-11-03 03:54:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:54:21,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-11-03 03:54:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:21,300 INFO L225 Difference]: With dead ends: 460 [2022-11-03 03:54:21,301 INFO L226 Difference]: Without dead ends: 456 [2022-11-03 03:54:21,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:21,303 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 348 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:21,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 552 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:54:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-03 03:54:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 408. [2022-11-03 03:54:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 324 states have (on average 1.191358024691358) internal successors, (386), 330 states have internal predecessors, (386), 49 states have call successors, (49), 29 states have call predecessors, (49), 34 states have return successors, (58), 48 states have call predecessors, (58), 44 states have call successors, (58) [2022-11-03 03:54:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 493 transitions. [2022-11-03 03:54:21,361 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 493 transitions. Word has length 43 [2022-11-03 03:54:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:21,361 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 493 transitions. [2022-11-03 03:54:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 493 transitions. [2022-11-03 03:54:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 03:54:21,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:21,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:21,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-03 03:54:21,364 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 521522267, now seen corresponding path program 1 times [2022-11-03 03:54:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:21,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11925187] [2022-11-03 03:54:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:21,541 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 03:54:21,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:21,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11925187] [2022-11-03 03:54:21,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11925187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:21,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:21,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292075217] [2022-11-03 03:54:21,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:21,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:21,544 INFO L87 Difference]: Start difference. First operand 408 states and 493 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:21,874 INFO L93 Difference]: Finished difference Result 418 states and 502 transitions. [2022-11-03 03:54:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-03 03:54:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:21,889 INFO L225 Difference]: With dead ends: 418 [2022-11-03 03:54:21,889 INFO L226 Difference]: Without dead ends: 398 [2022-11-03 03:54:21,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:21,890 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 58 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:21,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1594 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-03 03:54:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2022-11-03 03:54:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.1832797427652733) internal successors, (368), 317 states have internal predecessors, (368), 49 states have call successors, (49), 29 states have call predecessors, (49), 33 states have return successors, (57), 47 states have call predecessors, (57), 44 states have call successors, (57) [2022-11-03 03:54:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 474 transitions. [2022-11-03 03:54:21,951 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 474 transitions. Word has length 43 [2022-11-03 03:54:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:21,952 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 474 transitions. [2022-11-03 03:54:21,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 474 transitions. [2022-11-03 03:54:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 03:54:21,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:21,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:21,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-03 03:54:21,954 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2006604706, now seen corresponding path program 1 times [2022-11-03 03:54:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407528572] [2022-11-03 03:54:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:21,989 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 03:54:21,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:21,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407528572] [2022-11-03 03:54:21,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407528572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:21,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:21,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:54:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75282838] [2022-11-03 03:54:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:21,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:54:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:54:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:54:21,991 INFO L87 Difference]: Start difference. First operand 394 states and 474 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:22,119 INFO L93 Difference]: Finished difference Result 420 states and 504 transitions. [2022-11-03 03:54:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:54:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-03 03:54:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:22,122 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:54:22,122 INFO L226 Difference]: Without dead ends: 397 [2022-11-03 03:54:22,122 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 03:54:22,123 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 24 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:22,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 485 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-03 03:54:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2022-11-03 03:54:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 310 states have (on average 1.167741935483871) internal successors, (362), 316 states have internal predecessors, (362), 49 states have call successors, (49), 29 states have call predecessors, (49), 33 states have return successors, (57), 47 states have call predecessors, (57), 44 states have call successors, (57) [2022-11-03 03:54:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 468 transitions. [2022-11-03 03:54:22,198 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 468 transitions. Word has length 43 [2022-11-03 03:54:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:22,199 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 468 transitions. [2022-11-03 03:54:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:54:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 468 transitions. [2022-11-03 03:54:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:54:22,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:22,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:22,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-03 03:54:22,201 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1289765795, now seen corresponding path program 1 times [2022-11-03 03:54:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340054251] [2022-11-03 03:54:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:54:22,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:22,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340054251] [2022-11-03 03:54:22,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340054251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:22,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:22,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335241290] [2022-11-03 03:54:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:22,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:22,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:22,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:22,350 INFO L87 Difference]: Start difference. First operand 393 states and 468 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:54:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:22,626 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2022-11-03 03:54:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:22,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-03 03:54:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:22,628 INFO L225 Difference]: With dead ends: 412 [2022-11-03 03:54:22,628 INFO L226 Difference]: Without dead ends: 386 [2022-11-03 03:54:22,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:22,629 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 36 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:22,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1702 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-03 03:54:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-03 03:54:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 305 states have (on average 1.1639344262295082) internal successors, (355), 311 states have internal predecessors, (355), 47 states have call successors, (47), 29 states have call predecessors, (47), 33 states have return successors, (55), 45 states have call predecessors, (55), 42 states have call successors, (55) [2022-11-03 03:54:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 457 transitions. [2022-11-03 03:54:22,685 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 457 transitions. Word has length 45 [2022-11-03 03:54:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:22,685 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 457 transitions. [2022-11-03 03:54:22,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:54:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 457 transitions. [2022-11-03 03:54:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 03:54:22,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:22,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:22,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-03 03:54:22,688 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -458836335, now seen corresponding path program 1 times [2022-11-03 03:54:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:22,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075525097] [2022-11-03 03:54:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:22,802 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 03:54:22,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075525097] [2022-11-03 03:54:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075525097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:22,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:22,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703143010] [2022-11-03 03:54:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:22,804 INFO L87 Difference]: Start difference. First operand 386 states and 457 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:23,063 INFO L93 Difference]: Finished difference Result 405 states and 476 transitions. [2022-11-03 03:54:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:54:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-11-03 03:54:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:23,065 INFO L225 Difference]: With dead ends: 405 [2022-11-03 03:54:23,065 INFO L226 Difference]: Without dead ends: 381 [2022-11-03 03:54:23,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:54:23,066 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:23,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1636 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-03 03:54:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-03 03:54:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 301 states have (on average 1.1627906976744187) internal successors, (350), 307 states have internal predecessors, (350), 46 states have call successors, (46), 29 states have call predecessors, (46), 33 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-11-03 03:54:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 450 transitions. [2022-11-03 03:54:23,144 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 450 transitions. Word has length 44 [2022-11-03 03:54:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:23,144 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 450 transitions. [2022-11-03 03:54:23,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:54:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 450 transitions. [2022-11-03 03:54:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 03:54:23,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:23,148 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 03:54:23,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-03 03:54:23,148 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash 413737355, now seen corresponding path program 1 times [2022-11-03 03:54:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:23,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312541443] [2022-11-03 03:54:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:23,333 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 03:54:23,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312541443] [2022-11-03 03:54:23,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312541443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:23,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:23,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62755841] [2022-11-03 03:54:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:23,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:23,336 INFO L87 Difference]: Start difference. First operand 381 states and 450 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:23,679 INFO L93 Difference]: Finished difference Result 418 states and 489 transitions. [2022-11-03 03:54:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2022-11-03 03:54:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:23,692 INFO L225 Difference]: With dead ends: 418 [2022-11-03 03:54:23,692 INFO L226 Difference]: Without dead ends: 400 [2022-11-03 03:54:23,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:23,693 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 40 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:23,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1885 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-03 03:54:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 383. [2022-11-03 03:54:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 303 states have (on average 1.1617161716171618) internal successors, (352), 309 states have internal predecessors, (352), 46 states have call successors, (46), 29 states have call predecessors, (46), 33 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2022-11-03 03:54:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 452 transitions. [2022-11-03 03:54:23,748 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 452 transitions. Word has length 50 [2022-11-03 03:54:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:23,749 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 452 transitions. [2022-11-03 03:54:23,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 452 transitions. [2022-11-03 03:54:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 03:54:23,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:23,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-03 03:54:23,751 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -635545148, now seen corresponding path program 1 times [2022-11-03 03:54:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:23,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115889516] [2022-11-03 03:54:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:23,905 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 03:54:23,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:23,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115889516] [2022-11-03 03:54:23,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115889516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:23,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:23,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:54:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503274927] [2022-11-03 03:54:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:23,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:54:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:54:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:54:23,907 INFO L87 Difference]: Start difference. First operand 383 states and 452 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:24,199 INFO L93 Difference]: Finished difference Result 402 states and 471 transitions. [2022-11-03 03:54:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:54:24,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-03 03:54:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:24,202 INFO L225 Difference]: With dead ends: 402 [2022-11-03 03:54:24,202 INFO L226 Difference]: Without dead ends: 375 [2022-11-03 03:54:24,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:54:24,203 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 37 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:24,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1799 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:54:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-03 03:54:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-11-03 03:54:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 297 states have (on average 1.1582491582491583) internal successors, (344), 303 states have internal predecessors, (344), 44 states have call successors, (44), 29 states have call predecessors, (44), 33 states have return successors, (52), 42 states have call predecessors, (52), 39 states have call successors, (52) [2022-11-03 03:54:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2022-11-03 03:54:24,257 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 47 [2022-11-03 03:54:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:24,258 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2022-11-03 03:54:24,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 03:54:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2022-11-03 03:54:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 03:54:24,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:24,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:24,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-03 03:54:24,260 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1090985815, now seen corresponding path program 1 times [2022-11-03 03:54:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:24,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778403252] [2022-11-03 03:54:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:24,473 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 03:54:24,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778403252] [2022-11-03 03:54:24,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778403252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:24,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:24,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:54:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936797274] [2022-11-03 03:54:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:24,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:54:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:54:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:24,475 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:25,016 INFO L93 Difference]: Finished difference Result 420 states and 483 transitions. [2022-11-03 03:54:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:54:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2022-11-03 03:54:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:25,019 INFO L225 Difference]: With dead ends: 420 [2022-11-03 03:54:25,019 INFO L226 Difference]: Without dead ends: 349 [2022-11-03 03:54:25,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:54:25,020 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 225 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:25,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1106 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:54:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-03 03:54:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 333. [2022-11-03 03:54:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 262 states have (on average 1.1564885496183206) internal successors, (303), 266 states have internal predecessors, (303), 41 states have call successors, (41), 29 states have call predecessors, (41), 29 states have return successors, (47), 37 states have call predecessors, (47), 37 states have call successors, (47) [2022-11-03 03:54:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 391 transitions. [2022-11-03 03:54:25,082 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 391 transitions. Word has length 46 [2022-11-03 03:54:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:25,082 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 391 transitions. [2022-11-03 03:54:25,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:54:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 391 transitions. [2022-11-03 03:54:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:54:25,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:25,086 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] [2022-11-03 03:54:25,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-03 03:54:25,086 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:54:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -162720160, now seen corresponding path program 1 times [2022-11-03 03:54:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:25,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369653807] [2022-11-03 03:54:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:54:25,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:54:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:54:25,168 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:54:25,169 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:54:25,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:54:25,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-03 03:54:25,176 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:25,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:54:25,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:54:25 BoogieIcfgContainer [2022-11-03 03:54:25,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:54:25,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:54:25,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:54:25,304 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:54:25,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51" (3/4) ... [2022-11-03 03:54:25,307 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:54:25,424 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:54:25,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:54:25,431 INFO L158 Benchmark]: Toolchain (without parser) took 36628.71ms. Allocated memory was 107.0MB in the beginning and 564.1MB in the end (delta: 457.2MB). Free memory was 67.6MB in the beginning and 388.1MB in the end (delta: -320.5MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,431 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 107.0MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:54:25,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.05ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.24ms. Allocated memory is still 107.0MB. Free memory was 64.9MB in the beginning and 57.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,432 INFO L158 Benchmark]: Boogie Preprocessor took 142.21ms. Allocated memory is still 107.0MB. Free memory was 57.6MB in the beginning and 52.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,432 INFO L158 Benchmark]: RCFGBuilder took 1881.34ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 59.1MB in the end (delta: -6.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,432 INFO L158 Benchmark]: TraceAbstraction took 33677.05ms. Allocated memory was 140.5MB in the beginning and 564.1MB in the end (delta: 423.6MB). Free memory was 58.2MB in the beginning and 396.4MB in the end (delta: -338.2MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,434 INFO L158 Benchmark]: Witness Printer took 121.10ms. Allocated memory is still 564.1MB. Free memory was 396.4MB in the beginning and 388.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:54:25,435 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.37ms. Allocated memory is still 107.0MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.05ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.24ms. Allocated memory is still 107.0MB. Free memory was 64.9MB in the beginning and 57.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.21ms. Allocated memory is still 107.0MB. Free memory was 57.6MB in the beginning and 52.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1881.34ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 59.1MB in the end (delta: -6.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33677.05ms. Allocated memory was 140.5MB in the beginning and 564.1MB in the end (delta: 423.6MB). Free memory was 58.2MB in the beginning and 396.4MB in the end (delta: -338.2MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 121.10ms. Allocated memory is still 564.1MB. Free memory was 396.4MB in the beginning and 388.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 [L1767] COND FALSE !(irp_choice == 0) [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(Context)=-3, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=-3, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-3, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=-3, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-3, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND TRUE myStatus >= 0 [L1584] CALL HpCdrProcessLastSession(Irp__AssociatedIrp__SystemBuffer) [L1559] int index = __VERIFIER_nondet_int() ; [L1562] COND TRUE \read(index) [L1563] index -- [L1584] RET HpCdrProcessLastSession(Irp__AssociatedIrp__SystemBuffer) [L1587] return (myStatus); [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=0, compFptr=0, compRegistered=1, compRetStatus=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=0, compFptr=0, compRegistered=1, compRetStatus=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=0, compFptr=0, compRegistered=1, compRetStatus=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, tmp_ndt_5=-1, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=0, compFptr=0, compRegistered=1, compRetStatus=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-3, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, tmp_ndt_5=-1, UNLOADED=0] [L1981] return (returnVal2); [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND TRUE \read(we_should_unload) [L1821] FCALL CdAudioUnload(d) [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, d=-2, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=1] [L1871] CALL errorFn() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 350 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 60, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8050 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7956 mSDsluCounter, 91884 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81495 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19491 IncrementalHoareTripleChecker+Invalid, 20071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 20812 mSDtfsCounter, 19491 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=4, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 59 MinimizatonAttempts, 926 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2060 NumberOfCodeBlocks, 2060 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 5594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 59 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 03:54:25,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f85abac-1258-44c4-987f-b0a991738578/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE