./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur --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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- 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-38b53e6 [2022-11-25 23:26:49,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:26:49,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:26:49,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:26:49,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:26:49,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:26:49,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:26:49,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:26:49,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:26:49,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:26:49,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:26:49,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:26:49,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:26:49,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:26:49,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:26:49,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:26:49,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:26:49,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:26:49,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:26:49,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:26:49,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:26:49,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:26:49,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:26:49,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:26:49,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:26:49,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:26:49,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:26:49,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:26:49,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:26:49,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:26:49,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:26:49,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:26:49,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:26:49,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:26:49,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:26:49,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:26:49,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:26:49,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:26:49,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:26:49,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:26:49,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:26:49,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:26:49,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:26:49,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:26:49,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:26:49,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:26:49,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:26:49,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:26:49,130 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:26:49,131 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:26:49,131 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:26:49,131 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:26:49,132 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:26:49,133 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:26:49,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:26:49,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:26:49,133 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:26:49,134 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:26:49,134 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:26:49,134 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:26:49,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:26:49,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:26:49,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:26:49,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:26:49,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:26:49,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:26:49,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:26:49,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:26:49,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:26:49,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:26:49,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:26:49,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:26:49,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:26:49,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:26:49,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:26:49,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:26:49,140 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:26:49,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:26:49,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:26:49,141 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:26:49,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:26:49,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:26:49,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:26:49,143 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2022-11-25 23:26:49,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:26:49,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:26:49,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:26:49,478 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:26:49,478 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:26:49,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-25 23:26:52,509 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:26:52,826 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:26:52,827 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-25 23:26:52,850 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/data/dda0a4221/cc5afe6cb9b24c81af766bb57cd134e1/FLAG1b8045347 [2022-11-25 23:26:52,867 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/data/dda0a4221/cc5afe6cb9b24c81af766bb57cd134e1 [2022-11-25 23:26:52,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:26:52,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:26:52,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:26:52,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:26:52,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:26:52,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:52" (1/1) ... [2022-11-25 23:26:52,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620f9fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:52, skipping insertion in model container [2022-11-25 23:26:52,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:26:52" (1/1) ... [2022-11-25 23:26:52,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:26:52,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:26:53,146 WARN L237 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-25 23:26:53,154 WARN L237 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-25 23:26:53,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:26:53,576 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:26:53,588 WARN L237 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-25 23:26:53,589 WARN L237 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_6b7379b6-74c9-4e6c-986b-3a59fed939f7/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-25 23:26:53,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:26:53,805 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:26:53,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53 WrapperNode [2022-11-25 23:26:53,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:26:53,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:26:53,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:26:53,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:26:53,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,892 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 865 [2022-11-25 23:26:53,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:26:53,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:26:53,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:26:53,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:26:53,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,973 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:26:53,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:26:53,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:26:53,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:26:53,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (1/1) ... [2022-11-25 23:26:53,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:26:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:26:54,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:26:54,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:26:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:26:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2022-11-25 23:26:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2022-11-25 23:26:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2022-11-25 23:26:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2022-11-25 23:26:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:26:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:26:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:26:54,223 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:26:54,226 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:26:55,343 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:26:57,228 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:26:57,228 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:26:57,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:26:57 BoogieIcfgContainer [2022-11-25 23:26:57,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:26:57,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:26:57,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:26:57,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:26:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:26:52" (1/3) ... [2022-11-25 23:26:57,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c4444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:26:57, skipping insertion in model container [2022-11-25 23:26:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:26:53" (2/3) ... [2022-11-25 23:26:57,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c4444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:26:57, skipping insertion in model container [2022-11-25 23:26:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:26:57" (3/3) ... [2022-11-25 23:26:57,239 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2022-11-25 23:26:57,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:26:57,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 23:26:57,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:26:57,318 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;@60975991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:26:57,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 23:26:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 207 states have (on average 1.502415458937198) internal successors, (311), 209 states have internal predecessors, (311), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-25 23:26:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:26:57,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:26:57,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:26:57,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:26:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:26:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1927163450, now seen corresponding path program 1 times [2022-11-25 23:26:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:26:57,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977827180] [2022-11-25 23:26:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:26:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:26:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:26:58,982 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-25 23:26:58,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:26:58,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977827180] [2022-11-25 23:26:58,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977827180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:26:58,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:26:58,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:26:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966456659] [2022-11-25 23:26:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:26:58,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:26:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:26:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:26:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:26:59,042 INFO L87 Difference]: Start difference. First operand has 312 states, 207 states have (on average 1.502415458937198) internal successors, (311), 209 states have internal predecessors, (311), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-25 23:26:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:26:59,918 INFO L93 Difference]: Finished difference Result 527 states and 926 transitions. [2022-11-25 23:26:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:26:59,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-11-25 23:26:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:26:59,939 INFO L225 Difference]: With dead ends: 527 [2022-11-25 23:26:59,940 INFO L226 Difference]: Without dead ends: 212 [2022-11-25 23:26:59,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:26:59,953 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 290 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:26:59,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 276 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:26:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-25 23:27:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2022-11-25 23:27:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 106 states have (on average 1.9245283018867925) internal successors, (204), 203 states have internal predecessors, (204), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2022-11-25 23:27:00,049 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 6 [2022-11-25 23:27:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:00,049 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2022-11-25 23:27:00,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-25 23:27:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2022-11-25 23:27:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:27:00,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:00,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:00,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:27:00,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -388192148, now seen corresponding path program 1 times [2022-11-25 23:27:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358638702] [2022-11-25 23:27:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:02,185 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-25 23:27:02,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:02,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358638702] [2022-11-25 23:27:02,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358638702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:02,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:02,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151782423] [2022-11-25 23:27:02,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:02,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:02,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:02,196 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-25 23:27:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:02,752 INFO L93 Difference]: Finished difference Result 210 states and 305 transitions. [2022-11-25 23:27:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-25 23:27:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:02,758 INFO L225 Difference]: With dead ends: 210 [2022-11-25 23:27:02,758 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 23:27:02,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:02,759 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 295 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:02,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 292 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 23:27:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-11-25 23:27:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 106 states have (on average 1.9056603773584906) internal successors, (202), 201 states have internal predecessors, (202), 96 states have call successors, (96), 2 states have call predecessors, (96), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2022-11-25 23:27:02,793 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 7 [2022-11-25 23:27:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:02,794 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2022-11-25 23:27:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-25 23:27:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2022-11-25 23:27:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:27:02,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:02,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:27:02,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 850235135, now seen corresponding path program 1 times [2022-11-25 23:27:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538362845] [2022-11-25 23:27:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:05,694 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-25 23:27:05,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:05,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538362845] [2022-11-25 23:27:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538362845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:05,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125328712] [2022-11-25 23:27:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:05,698 INFO L87 Difference]: Start difference. First operand 204 states and 298 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-25 23:27:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:06,522 INFO L93 Difference]: Finished difference Result 338 states and 525 transitions. [2022-11-25 23:27:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:06,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-11-25 23:27:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:06,526 INFO L225 Difference]: With dead ends: 338 [2022-11-25 23:27:06,526 INFO L226 Difference]: Without dead ends: 335 [2022-11-25 23:27:06,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:06,527 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 292 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:06,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 129 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:27:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-25 23:27:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 209. [2022-11-25 23:27:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 111 states have (on average 1.864864864864865) internal successors, (207), 206 states have internal predecessors, (207), 96 states have call successors, (96), 2 states have call predecessors, (96), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 303 transitions. [2022-11-25 23:27:06,559 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 303 transitions. Word has length 8 [2022-11-25 23:27:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:06,559 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 303 transitions. [2022-11-25 23:27:06,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-25 23:27:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 303 transitions. [2022-11-25 23:27:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:27:06,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:06,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:06,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:27:06,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash 586782033, now seen corresponding path program 1 times [2022-11-25 23:27:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:06,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751494599] [2022-11-25 23:27:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:07,166 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-25 23:27:07,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:07,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751494599] [2022-11-25 23:27:07,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751494599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:07,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909751571] [2022-11-25 23:27:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:07,169 INFO L87 Difference]: Start difference. First operand 209 states and 303 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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-25 23:27:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:07,696 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-11-25 23:27:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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-25 23:27:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:07,698 INFO L225 Difference]: With dead ends: 215 [2022-11-25 23:27:07,698 INFO L226 Difference]: Without dead ends: 211 [2022-11-25 23:27:07,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:07,699 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 291 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:07,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 268 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-25 23:27:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-11-25 23:27:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 111 states have (on average 1.8468468468468469) internal successors, (205), 204 states have internal predecessors, (205), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-11-25 23:27:07,721 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 9 [2022-11-25 23:27:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:07,722 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-11-25 23:27:07,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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-25 23:27:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-11-25 23:27:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:27:07,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:07,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:07,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:27:07,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1009677255, now seen corresponding path program 1 times [2022-11-25 23:27:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111688853] [2022-11-25 23:27:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:09,714 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-25 23:27:09,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:09,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111688853] [2022-11-25 23:27:09,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111688853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:09,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:09,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596815257] [2022-11-25 23:27:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:09,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:09,718 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-25 23:27:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:10,296 INFO L93 Difference]: Finished difference Result 403 states and 585 transitions. [2022-11-25 23:27:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-11-25 23:27:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:10,303 INFO L225 Difference]: With dead ends: 403 [2022-11-25 23:27:10,303 INFO L226 Difference]: Without dead ends: 400 [2022-11-25 23:27:10,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:10,308 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:10,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 569 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-25 23:27:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 209. [2022-11-25 23:27:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 113 states have (on average 1.831858407079646) internal successors, (207), 206 states have internal predecessors, (207), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2022-11-25 23:27:10,358 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 10 [2022-11-25 23:27:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:10,358 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2022-11-25 23:27:10,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-25 23:27:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2022-11-25 23:27:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:27:10,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:10,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:27:10,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1234533942, now seen corresponding path program 1 times [2022-11-25 23:27:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:10,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835508729] [2022-11-25 23:27:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:11,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835508729] [2022-11-25 23:27:11,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835508729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:11,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:11,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789772861] [2022-11-25 23:27:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:11,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:11,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:11,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:11,501 INFO L87 Difference]: Start difference. First operand 209 states and 301 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-25 23:27:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:12,290 INFO L93 Difference]: Finished difference Result 381 states and 561 transitions. [2022-11-25 23:27:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:12,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-25 23:27:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:12,297 INFO L225 Difference]: With dead ends: 381 [2022-11-25 23:27:12,297 INFO L226 Difference]: Without dead ends: 378 [2022-11-25 23:27:12,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:12,298 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 284 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:12,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 175 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:27:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-25 23:27:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 210. [2022-11-25 23:27:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 114 states have (on average 1.8245614035087718) internal successors, (208), 207 states have internal predecessors, (208), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 302 transitions. [2022-11-25 23:27:12,323 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 302 transitions. Word has length 11 [2022-11-25 23:27:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:12,324 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 302 transitions. [2022-11-25 23:27:12,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-25 23:27:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 302 transitions. [2022-11-25 23:27:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:27:12,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:12,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:12,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:27:12,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -384836468, now seen corresponding path program 1 times [2022-11-25 23:27:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:12,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813074490] [2022-11-25 23:27:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:13,776 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-25 23:27:13,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:13,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813074490] [2022-11-25 23:27:13,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813074490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:13,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:13,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372827131] [2022-11-25 23:27:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:13,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:13,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:13,779 INFO L87 Difference]: Start difference. First operand 210 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-25 23:27:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:14,271 INFO L93 Difference]: Finished difference Result 403 states and 582 transitions. [2022-11-25 23:27:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-11-25 23:27:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:14,275 INFO L225 Difference]: With dead ends: 403 [2022-11-25 23:27:14,276 INFO L226 Difference]: Without dead ends: 397 [2022-11-25 23:27:14,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:14,277 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 276 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:14,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 564 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-25 23:27:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 282. [2022-11-25 23:27:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 186 states have (on average 1.8709677419354838) internal successors, (348), 279 states have internal predecessors, (348), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 442 transitions. [2022-11-25 23:27:14,306 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 442 transitions. Word has length 12 [2022-11-25 23:27:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:14,306 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 442 transitions. [2022-11-25 23:27:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-25 23:27:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 442 transitions. [2022-11-25 23:27:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:27:14,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:14,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:27:14,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 954295067, now seen corresponding path program 1 times [2022-11-25 23:27:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027725771] [2022-11-25 23:27:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:14,859 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-25 23:27:14,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:14,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027725771] [2022-11-25 23:27:14,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027725771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:14,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:14,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559802859] [2022-11-25 23:27:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:14,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:14,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:14,864 INFO L87 Difference]: Start difference. First operand 282 states and 442 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-25 23:27:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:15,364 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2022-11-25 23:27:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2022-11-25 23:27:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:15,366 INFO L225 Difference]: With dead ends: 404 [2022-11-25 23:27:15,366 INFO L226 Difference]: Without dead ends: 392 [2022-11-25 23:27:15,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:15,402 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 253 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:15,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 558 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-25 23:27:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 292. [2022-11-25 23:27:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 196 states have (on average 1.8214285714285714) internal successors, (357), 289 states have internal predecessors, (357), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 451 transitions. [2022-11-25 23:27:15,433 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 451 transitions. Word has length 13 [2022-11-25 23:27:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:15,434 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 451 transitions. [2022-11-25 23:27:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-25 23:27:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 451 transitions. [2022-11-25 23:27:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:27:15,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:15,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:27:15,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2066856960, now seen corresponding path program 1 times [2022-11-25 23:27:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:15,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431432404] [2022-11-25 23:27:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:18,357 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-25 23:27:18,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431432404] [2022-11-25 23:27:18,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431432404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:18,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:18,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904203838] [2022-11-25 23:27:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:18,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:18,361 INFO L87 Difference]: Start difference. First operand 292 states and 451 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-25 23:27:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:19,177 INFO L93 Difference]: Finished difference Result 325 states and 492 transitions. [2022-11-25 23:27:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:19,178 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), 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-25 23:27:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:19,179 INFO L225 Difference]: With dead ends: 325 [2022-11-25 23:27:19,179 INFO L226 Difference]: Without dead ends: 322 [2022-11-25 23:27:19,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:19,180 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 264 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:19,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 130 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:27:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-25 23:27:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2022-11-25 23:27:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 196 states have (on average 1.816326530612245) internal successors, (356), 289 states have internal predecessors, (356), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2022-11-25 23:27:19,218 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 15 [2022-11-25 23:27:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:19,218 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2022-11-25 23:27:19,218 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), 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-25 23:27:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2022-11-25 23:27:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:27:19,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:19,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:19,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:27:19,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:19,220 INFO L85 PathProgramCache]: Analyzing trace with hash 351287827, now seen corresponding path program 1 times [2022-11-25 23:27:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:19,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42940930] [2022-11-25 23:27:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:19,711 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-25 23:27:19,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:19,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42940930] [2022-11-25 23:27:19,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42940930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:19,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:19,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522511329] [2022-11-25 23:27:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:19,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:19,713 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:20,141 INFO L93 Difference]: Finished difference Result 298 states and 453 transitions. [2022-11-25 23:27:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:27:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:20,144 INFO L225 Difference]: With dead ends: 298 [2022-11-25 23:27:20,144 INFO L226 Difference]: Without dead ends: 294 [2022-11-25 23:27:20,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:20,145 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 265 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:20,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 286 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-25 23:27:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2022-11-25 23:27:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 196 states have (on average 1.7959183673469388) internal successors, (352), 287 states have internal predecessors, (352), 92 states have call successors, (92), 2 states have call predecessors, (92), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2022-11-25 23:27:20,179 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 16 [2022-11-25 23:27:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2022-11-25 23:27:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2022-11-25 23:27:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:27:20,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:20,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:20,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:27:20,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:20,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1995628315, now seen corresponding path program 1 times [2022-11-25 23:27:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:20,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641557078] [2022-11-25 23:27:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:20,533 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-25 23:27:20,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:20,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641557078] [2022-11-25 23:27:20,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641557078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:20,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:20,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:27:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501646997] [2022-11-25 23:27:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:27:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:27:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:20,542 INFO L87 Difference]: Start difference. First operand 290 states and 444 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-25 23:27:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:20,630 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2022-11-25 23:27:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:27:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 17 [2022-11-25 23:27:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:20,632 INFO L225 Difference]: With dead ends: 292 [2022-11-25 23:27:20,632 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 23:27:20,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:27:20,634 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:20,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 275 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:27:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 23:27:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-25 23:27:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 196 states have (on average 1.7755102040816326) internal successors, (348), 285 states have internal predecessors, (348), 90 states have call successors, (90), 2 states have call predecessors, (90), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 438 transitions. [2022-11-25 23:27:20,689 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 438 transitions. Word has length 17 [2022-11-25 23:27:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:20,690 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 438 transitions. [2022-11-25 23:27:20,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-25 23:27:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 438 transitions. [2022-11-25 23:27:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:27:20,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:20,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:20,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:27:20,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1735577896, now seen corresponding path program 1 times [2022-11-25 23:27:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:20,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282455324] [2022-11-25 23:27:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:21,552 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-25 23:27:21,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282455324] [2022-11-25 23:27:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282455324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:21,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:21,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145535859] [2022-11-25 23:27:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:21,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:21,556 INFO L87 Difference]: Start difference. First operand 288 states and 438 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:27:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:22,081 INFO L93 Difference]: Finished difference Result 290 states and 439 transitions. [2022-11-25 23:27:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2022-11-25 23:27:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:22,084 INFO L225 Difference]: With dead ends: 290 [2022-11-25 23:27:22,084 INFO L226 Difference]: Without dead ends: 287 [2022-11-25 23:27:22,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:22,085 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 270 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 275 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-25 23:27:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-25 23:27:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 196 states have (on average 1.7653061224489797) internal successors, (346), 284 states have internal predecessors, (346), 89 states have call successors, (89), 2 states have call predecessors, (89), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 435 transitions. [2022-11-25 23:27:22,127 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 435 transitions. Word has length 18 [2022-11-25 23:27:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:22,129 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 435 transitions. [2022-11-25 23:27:22,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:27:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 435 transitions. [2022-11-25 23:27:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:27:22,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:22,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:22,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:27:22,131 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2031024586, now seen corresponding path program 1 times [2022-11-25 23:27:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:22,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004779734] [2022-11-25 23:27:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:22,912 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-25 23:27:22,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:22,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004779734] [2022-11-25 23:27:22,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004779734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:22,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158400358] [2022-11-25 23:27:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:22,915 INFO L87 Difference]: Start difference. First operand 287 states and 435 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-25 23:27:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:23,384 INFO L93 Difference]: Finished difference Result 289 states and 436 transitions. [2022-11-25 23:27:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2022-11-25 23:27:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:23,385 INFO L225 Difference]: With dead ends: 289 [2022-11-25 23:27:23,386 INFO L226 Difference]: Without dead ends: 286 [2022-11-25 23:27:23,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:23,386 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 267 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:23,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 274 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-25 23:27:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-25 23:27:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 196 states have (on average 1.7551020408163265) internal successors, (344), 283 states have internal predecessors, (344), 88 states have call successors, (88), 2 states have call predecessors, (88), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 432 transitions. [2022-11-25 23:27:23,422 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 432 transitions. Word has length 19 [2022-11-25 23:27:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:23,422 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 432 transitions. [2022-11-25 23:27:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-25 23:27:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 432 transitions. [2022-11-25 23:27:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:27:23,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:23,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:23,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:27:23,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1463375971, now seen corresponding path program 1 times [2022-11-25 23:27:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:23,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839136163] [2022-11-25 23:27:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:24,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:24,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839136163] [2022-11-25 23:27:24,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839136163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:24,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:24,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519646499] [2022-11-25 23:27:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:24,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:24,366 INFO L87 Difference]: Start difference. First operand 286 states and 432 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-25 23:27:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:24,883 INFO L93 Difference]: Finished difference Result 288 states and 433 transitions. [2022-11-25 23:27:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2022-11-25 23:27:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:24,885 INFO L225 Difference]: With dead ends: 288 [2022-11-25 23:27:24,885 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 23:27:24,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:24,886 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 264 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:24,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 275 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 23:27:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-25 23:27:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.7448979591836735) internal successors, (342), 282 states have internal predecessors, (342), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2022-11-25 23:27:24,958 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 20 [2022-11-25 23:27:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:24,959 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2022-11-25 23:27:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-25 23:27:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2022-11-25 23:27:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:27:24,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:24,962 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-25 23:27:24,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:27:24,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1879363247, now seen corresponding path program 1 times [2022-11-25 23:27:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:24,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294904224] [2022-11-25 23:27:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:26,706 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-25 23:27:26,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294904224] [2022-11-25 23:27:26,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294904224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:26,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:26,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293211830] [2022-11-25 23:27:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:26,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:26,708 INFO L87 Difference]: Start difference. First operand 285 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-25 23:27:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:27,434 INFO L93 Difference]: Finished difference Result 312 states and 463 transitions. [2022-11-25 23:27:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2022-11-25 23:27:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:27,436 INFO L225 Difference]: With dead ends: 312 [2022-11-25 23:27:27,436 INFO L226 Difference]: Without dead ends: 306 [2022-11-25 23:27:27,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:27,437 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 244 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:27,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 117 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:27:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-25 23:27:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 285. [2022-11-25 23:27:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.7346938775510203) internal successors, (340), 282 states have internal predecessors, (340), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2022-11-25 23:27:27,476 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 21 [2022-11-25 23:27:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:27,477 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2022-11-25 23:27:27,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-25 23:27:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2022-11-25 23:27:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:27:27,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:27,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] [2022-11-25 23:27:27,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:27:27,478 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1869896606, now seen corresponding path program 1 times [2022-11-25 23:27:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115400616] [2022-11-25 23:27:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:29,820 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-25 23:27:29,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:29,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115400616] [2022-11-25 23:27:29,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115400616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:29,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:29,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174209467] [2022-11-25 23:27:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:29,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:27:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:27:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:29,827 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-25 23:27:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:30,758 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2022-11-25 23:27:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:27:30,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-25 23:27:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:30,760 INFO L225 Difference]: With dead ends: 360 [2022-11-25 23:27:30,761 INFO L226 Difference]: Without dead ends: 355 [2022-11-25 23:27:30,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:27:30,762 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 391 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:30,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 267 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:27:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-25 23:27:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 285. [2022-11-25 23:27:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.719387755102041) internal successors, (337), 282 states have internal predecessors, (337), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2022-11-25 23:27:30,802 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 22 [2022-11-25 23:27:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:30,803 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2022-11-25 23:27:30,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-25 23:27:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2022-11-25 23:27:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:27:30,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:30,804 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-25 23:27:30,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:27:30,805 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2132828268, now seen corresponding path program 1 times [2022-11-25 23:27:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111368327] [2022-11-25 23:27:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:31,387 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-25 23:27:31,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111368327] [2022-11-25 23:27:31,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111368327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:31,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:31,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188931581] [2022-11-25 23:27:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:31,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:31,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:31,390 INFO L87 Difference]: Start difference. First operand 285 states and 424 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-25 23:27:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:31,847 INFO L93 Difference]: Finished difference Result 291 states and 427 transitions. [2022-11-25 23:27:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:31,848 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-25 23:27:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:31,850 INFO L225 Difference]: With dead ends: 291 [2022-11-25 23:27:31,850 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 23:27:31,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:31,852 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 246 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:31,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 23:27:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-11-25 23:27:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 196 states have (on average 1.7091836734693877) internal successors, (335), 281 states have internal predecessors, (335), 86 states have call successors, (86), 2 states have call predecessors, (86), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 421 transitions. [2022-11-25 23:27:31,914 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 421 transitions. Word has length 23 [2022-11-25 23:27:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:31,914 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 421 transitions. [2022-11-25 23:27:31,915 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-25 23:27:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 421 transitions. [2022-11-25 23:27:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:27:31,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:31,918 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-25 23:27:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:27:31,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1693768406, now seen corresponding path program 1 times [2022-11-25 23:27:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:31,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431073783] [2022-11-25 23:27:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:34,362 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-25 23:27:34,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:34,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431073783] [2022-11-25 23:27:34,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431073783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:34,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:34,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355005054] [2022-11-25 23:27:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:34,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:34,365 INFO L87 Difference]: Start difference. First operand 284 states and 421 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:35,128 INFO L93 Difference]: Finished difference Result 320 states and 466 transitions. [2022-11-25 23:27:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:35,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 23:27:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:35,130 INFO L225 Difference]: With dead ends: 320 [2022-11-25 23:27:35,130 INFO L226 Difference]: Without dead ends: 317 [2022-11-25 23:27:35,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:35,131 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 230 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:35,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 143 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:27:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-25 23:27:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2022-11-25 23:27:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 196 states have (on average 1.7040816326530612) internal successors, (334), 281 states have internal predecessors, (334), 86 states have call successors, (86), 2 states have call predecessors, (86), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 420 transitions. [2022-11-25 23:27:35,190 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 420 transitions. Word has length 24 [2022-11-25 23:27:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:35,190 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 420 transitions. [2022-11-25 23:27:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 420 transitions. [2022-11-25 23:27:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:27:35,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:35,191 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-25 23:27:35,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:27:35,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -967807879, now seen corresponding path program 1 times [2022-11-25 23:27:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935755239] [2022-11-25 23:27:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:35,773 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-25 23:27:35,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:35,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935755239] [2022-11-25 23:27:35,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935755239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:35,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:35,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781732198] [2022-11-25 23:27:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:35,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:35,776 INFO L87 Difference]: Start difference. First operand 284 states and 420 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-25 23:27:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:36,229 INFO L93 Difference]: Finished difference Result 286 states and 421 transitions. [2022-11-25 23:27:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:36,230 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-25 23:27:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:36,231 INFO L225 Difference]: With dead ends: 286 [2022-11-25 23:27:36,231 INFO L226 Difference]: Without dead ends: 283 [2022-11-25 23:27:36,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:36,232 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 255 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 270 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-25 23:27:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-25 23:27:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 196 states have (on average 1.6938775510204083) internal successors, (332), 280 states have internal predecessors, (332), 85 states have call successors, (85), 2 states have call predecessors, (85), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2022-11-25 23:27:36,266 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 25 [2022-11-25 23:27:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:36,266 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2022-11-25 23:27:36,267 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-25 23:27:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2022-11-25 23:27:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:27:36,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:36,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:27:36,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 62138860, now seen corresponding path program 1 times [2022-11-25 23:27:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:36,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938633961] [2022-11-25 23:27:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:39,189 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-25 23:27:39,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938633961] [2022-11-25 23:27:39,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938633961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:39,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:39,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:39,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800961397] [2022-11-25 23:27:39,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:39,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:39,191 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:39,750 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2022-11-25 23:27:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:27:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:39,752 INFO L225 Difference]: With dead ends: 285 [2022-11-25 23:27:39,753 INFO L226 Difference]: Without dead ends: 280 [2022-11-25 23:27:39,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:39,754 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 248 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:39,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 88 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:27:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-25 23:27:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-25 23:27:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 277 states have internal predecessors, (327), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2022-11-25 23:27:39,810 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 409 transitions. Word has length 26 [2022-11-25 23:27:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:39,811 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 409 transitions. [2022-11-25 23:27:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-11-25 23:27:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:27:39,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:39,812 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-25 23:27:39,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:27:39,812 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1925723486, now seen corresponding path program 1 times [2022-11-25 23:27:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:39,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915613560] [2022-11-25 23:27:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:41,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:41,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915613560] [2022-11-25 23:27:41,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915613560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:41,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:41,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3636611] [2022-11-25 23:27:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:41,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:41,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:41,628 INFO L87 Difference]: Start difference. First operand 280 states and 409 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-25 23:27:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:42,325 INFO L93 Difference]: Finished difference Result 341 states and 479 transitions. [2022-11-25 23:27:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 27 [2022-11-25 23:27:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:42,328 INFO L225 Difference]: With dead ends: 341 [2022-11-25 23:27:42,328 INFO L226 Difference]: Without dead ends: 338 [2022-11-25 23:27:42,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:42,329 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 213 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:42,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 164 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:27:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-25 23:27:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 280. [2022-11-25 23:27:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.663265306122449) internal successors, (326), 277 states have internal predecessors, (326), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2022-11-25 23:27:42,369 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 27 [2022-11-25 23:27:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:42,369 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2022-11-25 23:27:42,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-25 23:27:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-11-25 23:27:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 23:27:42,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:42,371 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-25 23:27:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:27:42,371 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash -432688463, now seen corresponding path program 1 times [2022-11-25 23:27:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:42,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726607291] [2022-11-25 23:27:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:44,240 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-25 23:27:44,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:44,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726607291] [2022-11-25 23:27:44,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726607291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:44,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:44,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490113675] [2022-11-25 23:27:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:44,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:44,242 INFO L87 Difference]: Start difference. First operand 280 states and 408 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-25 23:27:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:44,945 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2022-11-25 23:27:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2022-11-25 23:27:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:44,947 INFO L225 Difference]: With dead ends: 307 [2022-11-25 23:27:44,947 INFO L226 Difference]: Without dead ends: 304 [2022-11-25 23:27:44,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:44,948 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 218 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:44,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 124 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:27:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-25 23:27:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2022-11-25 23:27:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6581632653061225) internal successors, (325), 277 states have internal predecessors, (325), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 407 transitions. [2022-11-25 23:27:45,011 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 407 transitions. Word has length 28 [2022-11-25 23:27:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:45,012 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 407 transitions. [2022-11-25 23:27:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-25 23:27:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-11-25 23:27:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:27:45,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:45,013 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-25 23:27:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:27:45,013 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -529008058, now seen corresponding path program 1 times [2022-11-25 23:27:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:45,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455948293] [2022-11-25 23:27:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:48,445 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-25 23:27:48,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455948293] [2022-11-25 23:27:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455948293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:48,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:48,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739107911] [2022-11-25 23:27:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:48,448 INFO L87 Difference]: Start difference. First operand 280 states and 407 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-25 23:27:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:49,261 INFO L93 Difference]: Finished difference Result 318 states and 454 transitions. [2022-11-25 23:27:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2022-11-25 23:27:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:49,263 INFO L225 Difference]: With dead ends: 318 [2022-11-25 23:27:49,263 INFO L226 Difference]: Without dead ends: 315 [2022-11-25 23:27:49,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:49,265 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 214 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:49,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 138 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:27:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-25 23:27:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2022-11-25 23:27:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.653061224489796) internal successors, (324), 277 states have internal predecessors, (324), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 406 transitions. [2022-11-25 23:27:49,337 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 406 transitions. Word has length 29 [2022-11-25 23:27:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:49,338 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 406 transitions. [2022-11-25 23:27:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-25 23:27:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 406 transitions. [2022-11-25 23:27:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 23:27:49,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:49,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:27:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:27:49,340 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash 780058486, now seen corresponding path program 1 times [2022-11-25 23:27:49,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:49,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512893850] [2022-11-25 23:27:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:50,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512893850] [2022-11-25 23:27:50,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512893850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:50,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:50,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151090715] [2022-11-25 23:27:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:50,930 INFO L87 Difference]: Start difference. First operand 280 states and 406 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-25 23:27:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:51,437 INFO L93 Difference]: Finished difference Result 350 states and 485 transitions. [2022-11-25 23:27:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 30 [2022-11-25 23:27:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:51,439 INFO L225 Difference]: With dead ends: 350 [2022-11-25 23:27:51,439 INFO L226 Difference]: Without dead ends: 347 [2022-11-25 23:27:51,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:51,440 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 197 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:51,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 481 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-25 23:27:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 280. [2022-11-25 23:27:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6479591836734695) internal successors, (323), 277 states have internal predecessors, (323), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 405 transitions. [2022-11-25 23:27:51,498 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 405 transitions. Word has length 30 [2022-11-25 23:27:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:51,498 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 405 transitions. [2022-11-25 23:27:51,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-25 23:27:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 405 transitions. [2022-11-25 23:27:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 23:27:51,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:51,499 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] [2022-11-25 23:27:51,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:27:51,500 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1588544728, now seen corresponding path program 1 times [2022-11-25 23:27:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100344197] [2022-11-25 23:27:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:27:52,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100344197] [2022-11-25 23:27:52,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100344197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:52,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:52,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461713594] [2022-11-25 23:27:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:52,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:52,098 INFO L87 Difference]: Start difference. First operand 280 states and 405 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-25 23:27:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:52,572 INFO L93 Difference]: Finished difference Result 282 states and 406 transitions. [2022-11-25 23:27:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:52,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 31 [2022-11-25 23:27:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:52,574 INFO L225 Difference]: With dead ends: 282 [2022-11-25 23:27:52,574 INFO L226 Difference]: Without dead ends: 279 [2022-11-25 23:27:52,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:52,580 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 241 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:52,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 263 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-25 23:27:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-25 23:27:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 196 states have (on average 1.6377551020408163) internal successors, (321), 276 states have internal predecessors, (321), 81 states have call successors, (81), 2 states have call predecessors, (81), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2022-11-25 23:27:52,667 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 31 [2022-11-25 23:27:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:52,668 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2022-11-25 23:27:52,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-25 23:27:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2022-11-25 23:27:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:27:52,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:52,669 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-25 23:27:52,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 23:27:52,670 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1365468416, now seen corresponding path program 1 times [2022-11-25 23:27:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254407322] [2022-11-25 23:27:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27:55,278 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-25 23:27:55,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:55,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254407322] [2022-11-25 23:27:55,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254407322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:55,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:55,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:27:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677337999] [2022-11-25 23:27:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:55,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:27:55,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:27:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:55,280 INFO L87 Difference]: Start difference. First operand 279 states and 402 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-25 23:27:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:55,996 INFO L93 Difference]: Finished difference Result 306 states and 438 transitions. [2022-11-25 23:27:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2022-11-25 23:27:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:55,998 INFO L225 Difference]: With dead ends: 306 [2022-11-25 23:27:55,999 INFO L226 Difference]: Without dead ends: 303 [2022-11-25 23:27:55,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:27:56,000 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 205 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:56,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 135 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:27:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-25 23:27:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 279. [2022-11-25 23:27:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 276 states have internal predecessors, (320), 81 states have call successors, (81), 2 states have call predecessors, (81), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 401 transitions. [2022-11-25 23:27:56,072 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 401 transitions. Word has length 34 [2022-11-25 23:27:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:56,072 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 401 transitions. [2022-11-25 23:27:56,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-25 23:27:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 401 transitions. [2022-11-25 23:27:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:27:56,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:56,073 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-25 23:27:56,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:27:56,073 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -620678926, now seen corresponding path program 1 times [2022-11-25 23:27:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:56,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666756166] [2022-11-25 23:27:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:27: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-25 23:27:58,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:27:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666756166] [2022-11-25 23:27:58,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666756166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:27:58,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:27:58,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:27:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27429798] [2022-11-25 23:27:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:27:58,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:27:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:27:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:27:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:58,006 INFO L87 Difference]: Start difference. First operand 279 states and 401 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-25 23:27:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:27:58,515 INFO L93 Difference]: Finished difference Result 281 states and 402 transitions. [2022-11-25 23:27:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:27:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-11-25 23:27:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:27:58,517 INFO L225 Difference]: With dead ends: 281 [2022-11-25 23:27:58,517 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 23:27:58,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:27:58,518 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 246 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:27:58,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 252 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:27:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 23:27:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-25 23:27:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 196 states have (on average 1.6224489795918366) internal successors, (318), 275 states have internal predecessors, (318), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:27:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 398 transitions. [2022-11-25 23:27:58,583 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 398 transitions. Word has length 35 [2022-11-25 23:27:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:27:58,583 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 398 transitions. [2022-11-25 23:27:58,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-25 23:27:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2022-11-25 23:27:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:27:58,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:27:58,584 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-25 23:27:58,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:27:58,584 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:27:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:27:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 511370714, now seen corresponding path program 1 times [2022-11-25 23:27:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:27:58,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770337186] [2022-11-25 23:27:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:27:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:27:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:00,725 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-25 23:28:00,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770337186] [2022-11-25 23:28:00,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770337186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:00,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:00,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760331027] [2022-11-25 23:28:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:00,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:00,727 INFO L87 Difference]: Start difference. First operand 278 states and 398 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-25 23:28:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:01,410 INFO L93 Difference]: Finished difference Result 312 states and 440 transitions. [2022-11-25 23:28:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 37 [2022-11-25 23:28:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:01,411 INFO L225 Difference]: With dead ends: 312 [2022-11-25 23:28:01,412 INFO L226 Difference]: Without dead ends: 305 [2022-11-25 23:28:01,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:01,413 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 194 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:01,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 136 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:28:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-25 23:28:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-11-25 23:28:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 278 states have internal predecessors, (321), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2022-11-25 23:28:01,487 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 37 [2022-11-25 23:28:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:01,487 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2022-11-25 23:28:01,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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-25 23:28:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2022-11-25 23:28:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:28:01,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:01,488 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-25 23:28:01,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 23:28:01,489 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1327883638, now seen corresponding path program 1 times [2022-11-25 23:28:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:01,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984093481] [2022-11-25 23:28:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:04,238 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-25 23:28:04,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:04,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984093481] [2022-11-25 23:28:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984093481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:04,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:04,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703305570] [2022-11-25 23:28:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:04,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:04,240 INFO L87 Difference]: Start difference. First operand 281 states and 401 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-25 23:28:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:04,910 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2022-11-25 23:28:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 38 [2022-11-25 23:28:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:04,912 INFO L225 Difference]: With dead ends: 308 [2022-11-25 23:28:04,912 INFO L226 Difference]: Without dead ends: 305 [2022-11-25 23:28:04,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:04,913 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 189 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:04,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 153 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:28:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-25 23:28:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-11-25 23:28:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 278 states have internal predecessors, (320), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2022-11-25 23:28:04,988 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 38 [2022-11-25 23:28:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:04,988 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2022-11-25 23:28:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-25 23:28:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2022-11-25 23:28:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:28:04,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:04,989 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-25 23:28:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 23:28:04,989 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1784780476, now seen corresponding path program 1 times [2022-11-25 23:28:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916279293] [2022-11-25 23:28:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:07,189 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-25 23:28:07,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916279293] [2022-11-25 23:28:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916279293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:07,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:07,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:28:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062768867] [2022-11-25 23:28:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:07,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:28:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:28:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:28:07,191 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-25 23:28:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:07,797 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2022-11-25 23:28:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2022-11-25 23:28:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:07,799 INFO L225 Difference]: With dead ends: 283 [2022-11-25 23:28:07,799 INFO L226 Difference]: Without dead ends: 280 [2022-11-25 23:28:07,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:28:07,800 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 238 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:07,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 85 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:28:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-25 23:28:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-25 23:28:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 277 states have internal predecessors, (318), 79 states have call successors, (79), 2 states have call predecessors, (79), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 397 transitions. [2022-11-25 23:28:07,880 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 397 transitions. Word has length 39 [2022-11-25 23:28:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:07,880 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 397 transitions. [2022-11-25 23:28:07,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-25 23:28:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 397 transitions. [2022-11-25 23:28:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:28:07,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:07,881 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-25 23:28:07,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 23:28:07,882 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -506873009, now seen corresponding path program 1 times [2022-11-25 23:28:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73662972] [2022-11-25 23:28:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:08,032 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-25 23:28:08,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73662972] [2022-11-25 23:28:08,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73662972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:08,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:08,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:28:08,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689347380] [2022-11-25 23:28:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:08,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:28:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:28:08,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:28:08,036 INFO L87 Difference]: Start difference. First operand 280 states and 397 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-25 23:28:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:08,159 INFO L93 Difference]: Finished difference Result 282 states and 398 transitions. [2022-11-25 23:28:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:28:08,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 40 [2022-11-25 23:28:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:08,161 INFO L225 Difference]: With dead ends: 282 [2022-11-25 23:28:08,161 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 23:28:08,162 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-25 23:28:08,163 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:08,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 23:28:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-25 23:28:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 275 states have internal predecessors, (315), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 392 transitions. [2022-11-25 23:28:08,245 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 392 transitions. Word has length 40 [2022-11-25 23:28:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 392 transitions. [2022-11-25 23:28:08,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-25 23:28:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 392 transitions. [2022-11-25 23:28:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:28:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:08,246 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-25 23:28:08,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 23:28:08,247 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1466319777, now seen corresponding path program 1 times [2022-11-25 23:28:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:08,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6896498] [2022-11-25 23:28:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:28:09,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6896498] [2022-11-25 23:28:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6896498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:09,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131267082] [2022-11-25 23:28:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:09,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:09,707 INFO L87 Difference]: Start difference. First operand 278 states and 392 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-25 23:28:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:10,341 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2022-11-25 23:28:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 41 [2022-11-25 23:28:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:10,343 INFO L225 Difference]: With dead ends: 306 [2022-11-25 23:28:10,343 INFO L226 Difference]: Without dead ends: 298 [2022-11-25 23:28:10,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:10,344 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 181 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:10,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 132 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:28:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-25 23:28:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 281. [2022-11-25 23:28:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5544554455445545) internal successors, (314), 278 states have internal predecessors, (314), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2022-11-25 23:28:10,401 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 41 [2022-11-25 23:28:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:10,402 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2022-11-25 23:28:10,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-25 23:28:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2022-11-25 23:28:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:28:10,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:10,402 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-25 23:28:10,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 23:28:10,403 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash 368700550, now seen corresponding path program 1 times [2022-11-25 23:28:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176061366] [2022-11-25 23:28:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:12,962 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-25 23:28:12,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:12,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176061366] [2022-11-25 23:28:12,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176061366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:12,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:12,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:28:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865258908] [2022-11-25 23:28:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:12,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:28:12,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:28:12,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:28:12,965 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-25 23:28:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:13,663 INFO L93 Difference]: Finished difference Result 321 states and 433 transitions. [2022-11-25 23:28:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:28:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 43 [2022-11-25 23:28:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:13,665 INFO L225 Difference]: With dead ends: 321 [2022-11-25 23:28:13,665 INFO L226 Difference]: Without dead ends: 318 [2022-11-25 23:28:13,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:28:13,666 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 302 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:13,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 171 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:28:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-25 23:28:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2022-11-25 23:28:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5495049504950495) internal successors, (313), 278 states have internal predecessors, (313), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2022-11-25 23:28:13,728 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 43 [2022-11-25 23:28:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:13,728 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2022-11-25 23:28:13,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-25 23:28:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2022-11-25 23:28:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 23:28:13,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:13,729 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-25 23:28:13,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 23:28:13,729 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1455650596, now seen corresponding path program 1 times [2022-11-25 23:28:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:13,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915760688] [2022-11-25 23:28:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:15,729 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-25 23:28:15,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:15,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915760688] [2022-11-25 23:28:15,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915760688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:15,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:15,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986893851] [2022-11-25 23:28:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:15,731 INFO L87 Difference]: Start difference. First operand 281 states and 390 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-25 23:28:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:16,183 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-11-25 23:28:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2022-11-25 23:28:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:16,188 INFO L225 Difference]: With dead ends: 330 [2022-11-25 23:28:16,189 INFO L226 Difference]: Without dead ends: 327 [2022-11-25 23:28:16,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:16,189 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:16,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 442 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-25 23:28:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 281. [2022-11-25 23:28:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5445544554455446) internal successors, (312), 278 states have internal predecessors, (312), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 389 transitions. [2022-11-25 23:28:16,246 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 389 transitions. Word has length 44 [2022-11-25 23:28:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:16,247 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 389 transitions. [2022-11-25 23:28:16,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-25 23:28:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 389 transitions. [2022-11-25 23:28:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:28:16,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:16,248 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-25 23:28:16,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 23:28:16,248 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1264432542, now seen corresponding path program 1 times [2022-11-25 23:28:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340588765] [2022-11-25 23:28:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:18,318 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-25 23:28:18,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340588765] [2022-11-25 23:28:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340588765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:18,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:18,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833983330] [2022-11-25 23:28:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:18,320 INFO L87 Difference]: Start difference. First operand 281 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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-25 23:28:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:18,977 INFO L93 Difference]: Finished difference Result 310 states and 420 transitions. [2022-11-25 23:28:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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 46 [2022-11-25 23:28:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:18,980 INFO L225 Difference]: With dead ends: 310 [2022-11-25 23:28:18,980 INFO L226 Difference]: Without dead ends: 294 [2022-11-25 23:28:18,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:18,981 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 151 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:18,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 153 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:28:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-25 23:28:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2022-11-25 23:28:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 208 states have (on average 1.5) internal successors, (312), 284 states have internal predecessors, (312), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 389 transitions. [2022-11-25 23:28:19,058 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 389 transitions. Word has length 46 [2022-11-25 23:28:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:19,059 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 389 transitions. [2022-11-25 23:28:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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-25 23:28:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 389 transitions. [2022-11-25 23:28:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 23:28:19,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:19,060 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] [2022-11-25 23:28:19,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 23:28:19,060 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash -370317725, now seen corresponding path program 1 times [2022-11-25 23:28:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:19,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432792739] [2022-11-25 23:28:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:19,827 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-25 23:28:19,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:19,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432792739] [2022-11-25 23:28:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432792739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:19,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:19,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137252998] [2022-11-25 23:28:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:19,829 INFO L87 Difference]: Start difference. First operand 287 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-25 23:28:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:20,237 INFO L93 Difference]: Finished difference Result 293 states and 392 transitions. [2022-11-25 23:28:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2022-11-25 23:28:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:20,239 INFO L225 Difference]: With dead ends: 293 [2022-11-25 23:28:20,239 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 23:28:20,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:20,239 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 213 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:20,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 240 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 23:28:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-11-25 23:28:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.4807692307692308) internal successors, (308), 281 states have internal predecessors, (308), 74 states have call successors, (74), 2 states have call predecessors, (74), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 382 transitions. [2022-11-25 23:28:20,302 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 382 transitions. Word has length 48 [2022-11-25 23:28:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:20,302 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 382 transitions. [2022-11-25 23:28:20,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-25 23:28:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 382 transitions. [2022-11-25 23:28:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 23:28:20,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:20,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:20,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 23:28:20,304 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1207068698, now seen corresponding path program 1 times [2022-11-25 23:28:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:20,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389357861] [2022-11-25 23:28:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:22,830 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-25 23:28:22,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:22,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389357861] [2022-11-25 23:28:22,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389357861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:22,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:22,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816979977] [2022-11-25 23:28:22,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:22,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:22,833 INFO L87 Difference]: Start difference. First operand 284 states and 382 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-25 23:28:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:23,451 INFO L93 Difference]: Finished difference Result 315 states and 410 transitions. [2022-11-25 23:28:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:23,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 51 [2022-11-25 23:28:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:23,454 INFO L225 Difference]: With dead ends: 315 [2022-11-25 23:28:23,454 INFO L226 Difference]: Without dead ends: 312 [2022-11-25 23:28:23,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:23,454 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:23,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 203 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:28:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-25 23:28:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2022-11-25 23:28:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.4759615384615385) internal successors, (307), 281 states have internal predecessors, (307), 74 states have call successors, (74), 2 states have call predecessors, (74), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 381 transitions. [2022-11-25 23:28:23,527 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 381 transitions. Word has length 51 [2022-11-25 23:28:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 381 transitions. [2022-11-25 23:28:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-25 23:28:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-11-25 23:28:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 23:28:23,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:23,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:23,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 23:28:23,529 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1235987475, now seen corresponding path program 1 times [2022-11-25 23:28:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:23,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197636738] [2022-11-25 23:28:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:23,637 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-25 23:28:23,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197636738] [2022-11-25 23:28:23,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197636738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:23,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:28:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809516972] [2022-11-25 23:28:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:28:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:28:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:28:23,639 INFO L87 Difference]: Start difference. First operand 284 states and 381 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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-25 23:28:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:23,735 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2022-11-25 23:28:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:28:23,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 52 [2022-11-25 23:28:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:23,737 INFO L225 Difference]: With dead ends: 286 [2022-11-25 23:28:23,737 INFO L226 Difference]: Without dead ends: 281 [2022-11-25 23:28:23,737 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-25 23:28:23,738 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:23,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 240 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:28:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-25 23:28:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-25 23:28:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 208 states have (on average 1.4471153846153846) internal successors, (301), 278 states have internal predecessors, (301), 71 states have call successors, (71), 2 states have call predecessors, (71), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2022-11-25 23:28:23,802 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 52 [2022-11-25 23:28:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:23,802 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2022-11-25 23:28:23,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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-25 23:28:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2022-11-25 23:28:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:28:23,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:23,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:23,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 23:28:23,804 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1909035186, now seen corresponding path program 1 times [2022-11-25 23:28:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:23,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921334055] [2022-11-25 23:28:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:24,811 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-25 23:28:24,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:24,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921334055] [2022-11-25 23:28:24,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921334055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:24,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:24,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084110286] [2022-11-25 23:28:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:24,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:24,814 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-25 23:28:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:24,942 INFO L93 Difference]: Finished difference Result 283 states and 373 transitions. [2022-11-25 23:28:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:28:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 54 [2022-11-25 23:28:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:24,944 INFO L225 Difference]: With dead ends: 283 [2022-11-25 23:28:24,944 INFO L226 Difference]: Without dead ends: 280 [2022-11-25 23:28:24,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:24,948 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:24,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 230 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:28:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-25 23:28:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-25 23:28:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 208 states have (on average 1.4375) internal successors, (299), 277 states have internal predecessors, (299), 70 states have call successors, (70), 2 states have call predecessors, (70), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 369 transitions. [2022-11-25 23:28:25,003 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 369 transitions. Word has length 54 [2022-11-25 23:28:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:25,003 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 369 transitions. [2022-11-25 23:28:25,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-25 23:28:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 369 transitions. [2022-11-25 23:28:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 23:28:25,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:25,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:25,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 23:28:25,005 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -949842460, now seen corresponding path program 1 times [2022-11-25 23:28:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:25,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089159071] [2022-11-25 23:28:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:27,940 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-25 23:28:27,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:27,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089159071] [2022-11-25 23:28:27,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089159071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:27,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:27,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:27,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729902208] [2022-11-25 23:28:27,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:27,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:27,941 INFO L87 Difference]: Start difference. First operand 280 states and 369 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-25 23:28:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:28,451 INFO L93 Difference]: Finished difference Result 282 states and 370 transitions. [2022-11-25 23:28:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 55 [2022-11-25 23:28:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:28,453 INFO L225 Difference]: With dead ends: 282 [2022-11-25 23:28:28,453 INFO L226 Difference]: Without dead ends: 277 [2022-11-25 23:28:28,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:28,454 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 189 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:28,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 73 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:28:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-25 23:28:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-11-25 23:28:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.4086538461538463) internal successors, (293), 274 states have internal predecessors, (293), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 360 transitions. [2022-11-25 23:28:28,508 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 360 transitions. Word has length 55 [2022-11-25 23:28:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:28,508 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 360 transitions. [2022-11-25 23:28:28,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-25 23:28:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 360 transitions. [2022-11-25 23:28:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 23:28:28,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:28,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:28,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 23:28:28,509 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1428857774, now seen corresponding path program 1 times [2022-11-25 23:28:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:28,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526281213] [2022-11-25 23:28:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:30,287 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-25 23:28:30,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526281213] [2022-11-25 23:28:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526281213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:30,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:30,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336336879] [2022-11-25 23:28:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:30,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:30,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:30,290 INFO L87 Difference]: Start difference. First operand 277 states and 360 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-25 23:28:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:30,708 INFO L93 Difference]: Finished difference Result 297 states and 377 transitions. [2022-11-25 23:28:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:30,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 59 [2022-11-25 23:28:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:30,710 INFO L225 Difference]: With dead ends: 297 [2022-11-25 23:28:30,710 INFO L226 Difference]: Without dead ends: 294 [2022-11-25 23:28:30,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:30,711 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 94 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:30,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 367 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-25 23:28:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-11-25 23:28:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 274 states have internal predecessors, (292), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 359 transitions. [2022-11-25 23:28:30,777 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 359 transitions. Word has length 59 [2022-11-25 23:28:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:30,777 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 359 transitions. [2022-11-25 23:28:30,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-25 23:28:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 359 transitions. [2022-11-25 23:28:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 23:28:30,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:30,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 23:28:30,778 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064462, now seen corresponding path program 1 times [2022-11-25 23:28:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:30,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491818603] [2022-11-25 23:28:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:32,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-25 23:28:32,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:32,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491818603] [2022-11-25 23:28:32,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491818603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:32,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:32,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530019649] [2022-11-25 23:28:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:32,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:32,475 INFO L87 Difference]: Start difference. First operand 277 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-25 23:28:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:33,028 INFO L93 Difference]: Finished difference Result 301 states and 379 transitions. [2022-11-25 23:28:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 64 [2022-11-25 23:28:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:33,030 INFO L225 Difference]: With dead ends: 301 [2022-11-25 23:28:33,030 INFO L226 Difference]: Without dead ends: 294 [2022-11-25 23:28:33,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:33,030 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 93 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:33,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 207 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:28:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-25 23:28:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-11-25 23:28:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.3894230769230769) internal successors, (289), 274 states have internal predecessors, (289), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 356 transitions. [2022-11-25 23:28:33,086 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 356 transitions. Word has length 64 [2022-11-25 23:28:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:33,087 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 356 transitions. [2022-11-25 23:28:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-25 23:28:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 356 transitions. [2022-11-25 23:28:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 23:28:33,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:33,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:33,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-25 23:28:33,088 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1401761456, now seen corresponding path program 1 times [2022-11-25 23:28:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774383599] [2022-11-25 23:28:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:35,202 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-25 23:28:35,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:35,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774383599] [2022-11-25 23:28:35,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774383599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:35,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:35,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998314098] [2022-11-25 23:28:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:35,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:35,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:35,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:35,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:35,208 INFO L87 Difference]: Start difference. First operand 277 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-25 23:28:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:35,762 INFO L93 Difference]: Finished difference Result 290 states and 366 transitions. [2022-11-25 23:28:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 66 [2022-11-25 23:28:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:35,764 INFO L225 Difference]: With dead ends: 290 [2022-11-25 23:28:35,764 INFO L226 Difference]: Without dead ends: 287 [2022-11-25 23:28:35,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:35,765 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:35,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 143 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:28:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-25 23:28:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2022-11-25 23:28:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 274 states have internal predecessors, (288), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2022-11-25 23:28:35,838 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 66 [2022-11-25 23:28:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:35,838 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2022-11-25 23:28:35,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-25 23:28:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-11-25 23:28:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:28:35,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:35,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:35,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-25 23:28:35,840 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -505241790, now seen corresponding path program 1 times [2022-11-25 23:28:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556420882] [2022-11-25 23:28:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:36,635 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-25 23:28:36,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:36,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556420882] [2022-11-25 23:28:36,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556420882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:36,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:36,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457159528] [2022-11-25 23:28:36,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:36,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:36,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:36,637 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-25 23:28:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:37,031 INFO L93 Difference]: Finished difference Result 279 states and 356 transitions. [2022-11-25 23:28:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 67 [2022-11-25 23:28:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:37,033 INFO L225 Difference]: With dead ends: 279 [2022-11-25 23:28:37,033 INFO L226 Difference]: Without dead ends: 276 [2022-11-25 23:28:37,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:37,034 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 175 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:37,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-25 23:28:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-11-25 23:28:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.375) internal successors, (286), 273 states have internal predecessors, (286), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 352 transitions. [2022-11-25 23:28:37,095 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 352 transitions. Word has length 67 [2022-11-25 23:28:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:37,095 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 352 transitions. [2022-11-25 23:28:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-25 23:28:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 352 transitions. [2022-11-25 23:28:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 23:28:37,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:37,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-25 23:28:37,096 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1901725405, now seen corresponding path program 1 times [2022-11-25 23:28:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:37,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110548096] [2022-11-25 23:28:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:39,442 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-25 23:28:39,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:39,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110548096] [2022-11-25 23:28:39,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110548096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:39,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:39,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015904669] [2022-11-25 23:28:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:39,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:39,444 INFO L87 Difference]: Start difference. First operand 276 states and 352 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-25 23:28:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:40,026 INFO L93 Difference]: Finished difference Result 292 states and 365 transitions. [2022-11-25 23:28:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 70 [2022-11-25 23:28:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:40,028 INFO L225 Difference]: With dead ends: 292 [2022-11-25 23:28:40,028 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 23:28:40,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:40,029 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 110 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:40,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 143 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:28:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 23:28:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2022-11-25 23:28:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.3701923076923077) internal successors, (285), 273 states have internal predecessors, (285), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 351 transitions. [2022-11-25 23:28:40,080 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 351 transitions. Word has length 70 [2022-11-25 23:28:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:40,081 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 351 transitions. [2022-11-25 23:28:40,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-25 23:28:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 351 transitions. [2022-11-25 23:28:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 23:28:40,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:40,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:40,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-25 23:28:40,082 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -892407311, now seen corresponding path program 1 times [2022-11-25 23:28:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:40,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034593893] [2022-11-25 23:28:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:40,736 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-25 23:28:40,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034593893] [2022-11-25 23:28:40,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034593893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:40,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:40,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117360261] [2022-11-25 23:28:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:40,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:40,738 INFO L87 Difference]: Start difference. First operand 276 states and 351 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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-25 23:28:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:41,047 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2022-11-25 23:28:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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 73 [2022-11-25 23:28:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:41,054 INFO L225 Difference]: With dead ends: 296 [2022-11-25 23:28:41,055 INFO L226 Difference]: Without dead ends: 290 [2022-11-25 23:28:41,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:41,056 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 54 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:41,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:28:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-25 23:28:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2022-11-25 23:28:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.3605769230769231) internal successors, (283), 273 states have internal predecessors, (283), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 349 transitions. [2022-11-25 23:28:41,132 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 349 transitions. Word has length 73 [2022-11-25 23:28:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:41,132 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 349 transitions. [2022-11-25 23:28:41,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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-25 23:28:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 349 transitions. [2022-11-25 23:28:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 23:28:41,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:41,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:41,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-25 23:28:41,133 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1895084956, now seen corresponding path program 1 times [2022-11-25 23:28:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:41,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401144788] [2022-11-25 23:28:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:43,152 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-25 23:28:43,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401144788] [2022-11-25 23:28:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401144788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:43,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716946520] [2022-11-25 23:28:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:43,154 INFO L87 Difference]: Start difference. First operand 276 states and 349 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-25 23:28:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:43,618 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2022-11-25 23:28:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 74 [2022-11-25 23:28:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:43,620 INFO L225 Difference]: With dead ends: 278 [2022-11-25 23:28:43,620 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 23:28:43,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:43,621 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 166 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:43,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 222 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:28:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 23:28:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-11-25 23:28:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 272 states have internal predecessors, (281), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 346 transitions. [2022-11-25 23:28:43,703 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 346 transitions. Word has length 74 [2022-11-25 23:28:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:43,704 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 346 transitions. [2022-11-25 23:28:43,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-25 23:28:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 346 transitions. [2022-11-25 23:28:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:28:43,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:43,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:28:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-25 23:28:43,705 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1587511931, now seen corresponding path program 1 times [2022-11-25 23:28:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:43,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331090302] [2022-11-25 23:28:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:45,817 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-25 23:28:45,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331090302] [2022-11-25 23:28:45,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331090302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:45,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:45,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004000005] [2022-11-25 23:28:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:45,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:45,819 INFO L87 Difference]: Start difference. First operand 275 states and 346 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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-25 23:28:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:46,363 INFO L93 Difference]: Finished difference Result 289 states and 357 transitions. [2022-11-25 23:28:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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 81 [2022-11-25 23:28:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:46,368 INFO L225 Difference]: With dead ends: 289 [2022-11-25 23:28:46,368 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 23:28:46,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:46,369 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:46,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 147 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:28:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 23:28:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-11-25 23:28:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3269230769230769) internal successors, (276), 272 states have internal predecessors, (276), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 341 transitions. [2022-11-25 23:28:46,419 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 341 transitions. Word has length 81 [2022-11-25 23:28:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:46,419 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 341 transitions. [2022-11-25 23:28:46,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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-25 23:28:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 341 transitions. [2022-11-25 23:28:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-25 23:28:46,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:28:46,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-25 23:28:46,420 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1079023560, now seen corresponding path program 1 times [2022-11-25 23:28:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:46,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270128150] [2022-11-25 23:28:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:28:48,309 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-25 23:28:48,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:28:48,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270128150] [2022-11-25 23:28:48,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270128150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:28:48,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:28:48,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:28:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207751201] [2022-11-25 23:28:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:28:48,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:28:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:28:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:28:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:48,311 INFO L87 Difference]: Start difference. First operand 275 states and 341 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 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-25 23:28:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:28:48,686 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2022-11-25 23:28:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:28:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 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 95 [2022-11-25 23:28:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:28:48,687 INFO L225 Difference]: With dead ends: 287 [2022-11-25 23:28:48,687 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 23:28:48,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:28:48,688 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 24 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:28:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 482 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:28:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 23:28:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-11-25 23:28:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3125) internal successors, (273), 272 states have internal predecessors, (273), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:28:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2022-11-25 23:28:48,762 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 95 [2022-11-25 23:28:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:28:48,763 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2022-11-25 23:28:48,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 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-25 23:28:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2022-11-25 23:28:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-25 23:28:48,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:28:48,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:28:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-25 23:28:48,764 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:28:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:28:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 275939282, now seen corresponding path program 1 times [2022-11-25 23:28:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:28:48,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979128219] [2022-11-25 23:28:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:28:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:28:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:29:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:29:33,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:29:33,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979128219] [2022-11-25 23:29:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979128219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:29:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263025323] [2022-11-25 23:29:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:29:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:29:33,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:29:33,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:29:33,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:29:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:29:34,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:29:34,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:31:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:31:59,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:34:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:34:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263025323] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:34:27,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:34:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 4] total 9 [2022-11-25 23:34:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506766486] [2022-11-25 23:34:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:34:27,137 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-25 23:34:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:27,253 INFO L93 Difference]: Finished difference Result 277 states and 339 transitions. [2022-11-25 23:34:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 111 [2022-11-25 23:34:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:27,256 INFO L225 Difference]: With dead ends: 277 [2022-11-25 23:34:27,256 INFO L226 Difference]: Without dead ends: 274 [2022-11-25 23:34:27,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:34:27,257 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:27,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-25 23:34:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-25 23:34:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 208 states have (on average 1.3076923076923077) internal successors, (272), 271 states have internal predecessors, (272), 64 states have call successors, (64), 2 states have call predecessors, (64), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2022-11-25 23:34:27,309 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 111 [2022-11-25 23:34:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:27,309 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2022-11-25 23:34:27,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-25 23:34:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2022-11-25 23:34:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:34:27,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:27,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:34:27,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:34:27,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-25 23:34:27,510 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:34:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1132823590, now seen corresponding path program 1 times [2022-11-25 23:34:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266159880] [2022-11-25 23:34:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:33,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:33,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266159880] [2022-11-25 23:34:33,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266159880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:34:33,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945615967] [2022-11-25 23:34:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:33,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:34:33,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:34:33,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:34:33,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b7379b6-74c9-4e6c-986b-3a59fed939f7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:34:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:34,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 23:34:34,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:38,315 INFO L328 TraceCheckSpWp]: Computing backward predicates...